131,701
131,701 is a prime, odd.
131,701 (one hundred thirty-one thousand seven hundred one) is an odd 6-digit number. It is a prime number — divisible only by 1 and itself. Written other ways, in hexadecimal, 0x20275.
Interestingness
Properties
- Parity
- Odd
- Digit count
- 6
- Digit sum
- 13
- Digit product
- 0
- Digital root
- 4
- Palindrome
- No
- Bit width
- 18 bits
- Reversed
- 107,131
- Recamán's sequence
- a(228,970) = 131,701
- Square (n²)
- 17,345,153,401
- Cube (n³)
- 2,284,374,048,065,101
- Divisor count
- 2
- σ(n) — sum of divisors
- 131,702
- φ(n) — Euler's totient
- 131,700
Primality
131,701 is prime. It has exactly two divisors: 1 and itself.
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√131,701 = [362; (1, 9, 1, 2, 12, 1, 5, 1, 3, 1, 7, 1, 19, 3, 1, 1, 1, 2, 1, 2, 1, 4, 1, 59, …)]
Representations
- In words
- one hundred thirty-one thousand seven hundred one
- Ordinal
- 131701st
- Binary
- 100000001001110101
- Octal
- 401165
- Hexadecimal
- 0x20275
- Base64
- AgJ1
- One's complement
- 4,294,835,594 (32-bit)
- Scientific notation
- 1.31701 × 10⁵
- As a duration
- 131,701 s = 1 day, 12 hours, 35 minutes, 1 second
Historical numeral systems
- Babylonian (base 60)
- 𒌋𒌋𒌋𒁹𒁹𒁹𒁹𒁹𒁹 𒌋𒌋𒌋𒁹𒁹𒁹𒁹𒁹 𒁹
- Egyptian hieroglyphic
- 𓆐𓂍𓂍𓂍𓆼𓍢𓍢𓍢𓍢𓍢𓍢𓍢𓏺
- Greek (Milesian)
- ͵ρλαψαʹ
- Mayan (base 20)
- 𝋰·𝋩·𝋥·𝋡
- Chinese
- 一十三萬一千七百零一
- Chinese (financial)
- 壹拾參萬壹仟柒佰零壹
Also seen as
UTF-8 encoding: F0 A0 89 B5 (4 bytes).
As an unsigned 32-bit integer, this is the IPv4 address 0.2.2.117.
- Address
- 0.2.2.117
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.2.2.117
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,701 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 131701 first appears in π at position 745,946 of the decimal expansion (the 745,946ordinal-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
- Prime numbers — The building blocks of arithmetic: what primes are, why they matter, and how we find them.
- Egyptian hieroglyphic numerals — Seven hieroglyphs for every power of ten, from a single stroke to a million.