130,642
130,642 is a composite number, even.
130,642 (one hundred thirty thousand six hundred forty-two) is an even 6-digit number. It is a composite number with 8 divisors, and factors as 2 × 83 × 787. Written other ways, in hexadecimal, 0x1FE52.
Interestingness
Properties
- Parity
- Even
- Digit count
- 6
- Digit sum
- 16
- Digit product
- 0
- Digital root
- 7
- Palindrome
- No
- Bit width
- 17 bits
- Reversed
- 246,031
- Square (n²)
- 17,067,332,164
- Cube (n³)
- 2,229,710,408,569,288
- Divisor count
- 8
- σ(n) — sum of divisors
- 198,576
- φ(n) — Euler's totient
- 64,452
- Sum of prime factors
- 872
Primality
Prime factorization: 2 × 83 × 787
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√130,642 = [361; (2, 3, 1, 102, 2, 30, 1, 13, 1, 3, 1, 1, 1, 3, 1, 5, 1, 1, 3, 1, 11, 1, 9, 3, …)]
Representations
- In words
- one hundred thirty thousand six hundred forty-two
- Ordinal
- 130642nd
- Binary
- 11111111001010010
- Octal
- 377122
- Hexadecimal
- 0x1FE52
- Base64
- Af5S
- One's complement
- 4,294,836,653 (32-bit)
- Scientific notation
- 1.30642 × 10⁵
- As a duration
- 130,642 s = 1 day, 12 hours, 17 minutes, 22 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 130642, here are decompositions:
- 3 + 130639 = 130642
- 11 + 130631 = 130642
- 23 + 130619 = 130642
- 53 + 130589 = 130642
- 89 + 130553 = 130642
- 173 + 130469 = 130642
- 233 + 130409 = 130642
- 263 + 130379 = 130642
Showing the first eight; more decompositions exist.
As an unsigned 32-bit integer, this is the IPv4 address 0.1.254.82.
- Address
- 0.1.254.82
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.1.254.82
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,642 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 130642 first appears in π at position 203,102 of the decimal expansion (the 203,102ordinal-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.