131,066
131,066 is a composite number, even.
Interestingness
Properties
- Parity
- Even
- Digit count
- 6
- Digit sum
- 17
- Digit product
- 0
- Digital root
- 8
- Palindrome
- No
- Bit width
- 17 bits
- Reversed
- 660,131
- Square (n²)
- 17,178,296,356
- Cube (n³)
- 2,251,490,590,195,496
- Divisor count
- 12
- σ(n) — sum of divisors
- 214,746
- φ(n) — Euler's totient
- 59,640
- Sum of prime factors
- 157
Primality
Prime factorization: 2 × 13 × 71 2
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√131,066 = [362; (32, 1, 10, 5, 1, 8, 3, 28, 1, 1, 1, 3, 1, 2, 3, 9, 2, 18, 1, 1, 2, 1, 1, 1, …)]
Representations
- In words
- one hundred thirty-one thousand sixty-six
- Ordinal
- 131066th
- Binary
- 11111111111111010
- Octal
- 377772
- Hexadecimal
- 0x1FFFA
- Base64
- Af/6
- One's complement
- 4,294,836,229 (32-bit)
- Scientific notation
- 1.31066 × 10⁵
- As a duration
- 131,066 s = 1 day, 12 hours, 24 minutes, 26 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 131066, here are decompositions:
- 3 + 131063 = 131066
- 7 + 131059 = 131066
- 43 + 131023 = 131066
- 79 + 130987 = 131066
- 97 + 130969 = 131066
- 109 + 130957 = 131066
- 139 + 130927 = 131066
- 193 + 130873 = 131066
Showing the first eight; more decompositions exist.
As an unsigned 32-bit integer, this is the IPv4 address 0.1.255.250.
- Address
- 0.1.255.250
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.1.255.250
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,066 and was likely granted around 1872.
Patent numbers below 100,000 are excluded as too ambiguous; modern numbering currently reaches roughly 12.5 million.