131,062
131,062 is a composite number, even.
Interestingness
Properties
- Parity
- Even
- Digit count
- 6
- Digit sum
- 13
- Digit product
- 0
- Digital root
- 4
- Palindrome
- No
- Bit width
- 17 bits
- Reversed
- 260,131
- Square (n²)
- 17,177,247,844
- Cube (n³)
- 2,251,284,456,930,328
- Divisor count
- 8
- σ(n) — sum of divisors
- 207,000
- φ(n) — Euler's totient
- 62,064
- Sum of prime factors
- 3,470
Primality
Prime factorization: 2 × 19 × 3449
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√131,062 = [362; (40, 4, 2, 8, 2, 42, 8, 2, 1, 1, 8, 1, 1, 3, 13, 2, 1, 1, 1, 4, 1, 9, 10, 2, …)]
Representations
- In words
- one hundred thirty-one thousand sixty-two
- Ordinal
- 131062nd
- Binary
- 11111111111110110
- Octal
- 377766
- Hexadecimal
- 0x1FFF6
- Base64
- Af/2
- One's complement
- 4,294,836,233 (32-bit)
- Scientific notation
- 1.31062 × 10⁵
- As a duration
- 131,062 s = 1 day, 12 hours, 24 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 131062, here are decompositions:
- 3 + 131059 = 131062
- 53 + 131009 = 131062
- 89 + 130973 = 131062
- 233 + 130829 = 131062
- 251 + 130811 = 131062
- 293 + 130769 = 131062
- 419 + 130643 = 131062
- 431 + 130631 = 131062
Showing the first eight; more decompositions exist.
As an unsigned 32-bit integer, this is the IPv4 address 0.1.255.246.
- Address
- 0.1.255.246
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.1.255.246
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,062 and was likely granted around 1872.
Patent numbers below 100,000 are excluded as too ambiguous; modern numbering currently reaches roughly 12.5 million.