130,606
130,606 is a composite number, even.
130,606 (one hundred thirty thousand six hundred six) is an even 6-digit number. It is a composite number with 16 divisors, and factors as 2 × 7 × 19 × 491. Written other ways, in hexadecimal, 0x1FE2E.
Interestingness
Properties
- Parity
- Even
- Digit count
- 6
- Digit sum
- 16
- Digit product
- 0
- Digital root
- 7
- Palindrome
- No
- Bit width
- 17 bits
- Reversed
- 606,031
- Square (n²)
- 17,057,927,236
- Cube (n³)
- 2,227,867,644,585,016
- Divisor count
- 16
- σ(n) — sum of divisors
- 236,160
- φ(n) — Euler's totient
- 52,920
- Sum of prime factors
- 519
Primality
Prime factorization: 2 × 7 × 19 × 491
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√130,606 = [361; (2, 1, 1, 6, 1, 2, 2, 1, 9, 1, 3, 2, 2, 1, 2, 5, 1, 1, 33, 1, 7, 16, 1, 2, …)]
Representations
- In words
- one hundred thirty thousand six hundred six
- Ordinal
- 130606th
- Binary
- 11111111000101110
- Octal
- 377056
- Hexadecimal
- 0x1FE2E
- Base64
- Af4u
- One's complement
- 4,294,836,689 (32-bit)
- Scientific notation
- 1.30606 × 10⁵
- As a duration
- 130,606 s = 1 day, 12 hours, 16 minutes, 46 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 130606, here are decompositions:
- 17 + 130589 = 130606
- 53 + 130553 = 130606
- 59 + 130547 = 130606
- 83 + 130523 = 130606
- 89 + 130517 = 130606
- 137 + 130469 = 130606
- 149 + 130457 = 130606
- 167 + 130439 = 130606
Showing the first eight; more decompositions exist.
As an unsigned 32-bit integer, this is the IPv4 address 0.1.254.46.
- Address
- 0.1.254.46
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.1.254.46
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 130,606 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 130606 first appears in π at position 480,422 of the decimal expansion (the 480,422ordinal-suffix:nd 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.