131,608
131,608 is a composite number, even.
131,608 (one hundred thirty-one thousand six hundred eight) is an even 6-digit number. It is a composite number with 8 divisors, and factors as 2³ × 16,451. Written other ways, in hexadecimal, 0x20218.
Interestingness
Properties
- Parity
- Even
- Digit count
- 6
- Digit sum
- 19
- Digit product
- 0
- Digital root
- 1
- Palindrome
- No
- Bit width
- 18 bits
- Reversed
- 806,131
- Recamán's sequence
- a(229,156) = 131,608
- Square (n²)
- 17,320,665,664
- Cube (n³)
- 2,279,538,166,707,712
- Divisor count
- 8
- σ(n) — sum of divisors
- 246,780
- φ(n) — Euler's totient
- 65,800
- Sum of prime factors
- 16,457
Primality
Prime factorization: 2 3 × 16451
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√131,608 = [362; (1, 3, 1, 1, 30, 1, 102, 1, 2, 6, 1, 1, 1, 3, 1, 5, 1, 13, 1, 21, 18, 1, 1, 3, …)]
Representations
- In words
- one hundred thirty-one thousand six hundred eight
- Ordinal
- 131608th
- Binary
- 100000001000011000
- Octal
- 401030
- Hexadecimal
- 0x20218
- Base64
- AgIY
- One's complement
- 4,294,835,687 (32-bit)
- Scientific notation
- 1.31608 × 10⁵
- As a duration
- 131,608 s = 1 day, 12 hours, 33 minutes, 28 seconds
Historical numeral systems
- Babylonian (base 60)
- 𒌋𒌋𒌋𒁹𒁹𒁹𒁹𒁹𒁹 𒌋𒌋𒌋𒁹𒁹𒁹 𒌋𒌋𒁹𒁹𒁹𒁹𒁹𒁹𒁹𒁹
- Egyptian hieroglyphic
- 𓆐𓂍𓂍𓂍𓆼𓍢𓍢𓍢𓍢𓍢𓍢𓏺𓏺𓏺𓏺𓏺𓏺𓏺𓏺
- Greek (Milesian)
- ͵ρλαχηʹ
- Mayan (base 20)
- 𝋰·𝋩·𝋠·𝋨
- Chinese
- 一十三萬一千六百零八
- Chinese (financial)
- 壹拾參萬壹仟陸佰零捌
Also seen as
Goldbach's conjecture says every even integer greater than 2 is the sum of two primes. For 131608, here are decompositions:
- 17 + 131591 = 131608
- 47 + 131561 = 131608
- 89 + 131519 = 131608
- 101 + 131507 = 131608
- 107 + 131501 = 131608
- 131 + 131477 = 131608
- 167 + 131441 = 131608
- 227 + 131381 = 131608
Showing the first eight; more decompositions exist.
UTF-8 encoding: F0 A0 88 98 (4 bytes).
As an unsigned 32-bit integer, this is the IPv4 address 0.2.2.24.
- Address
- 0.2.2.24
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.2.2.24
Unspecified address (0.0.0.0/8) — "this network" placeholder.
This number falls in the range of US utility patent numbers. If it's a patent, it would be issued as US 131,608 and was likely granted around 1872.
Patent numbers below 100,000 are excluded as too ambiguous; modern numbering currently reaches roughly 12.5 million.
The digit sequence 131608 first appears in π at position 661,098 of the decimal expansion (the 661,098ordinal-suffix:th digit after the integer 3).
Search range: the first 1,000,000 fractional digits of π. Any 6-digit-or-shorter string is virtually guaranteed to appear in there — the more interesting signal is the position.
Related reading
- Egyptian hieroglyphic numerals — Seven hieroglyphs for every power of ten, from a single stroke to a million.