141,697
141,697 is a prime, odd.
141,697 (one hundred forty-one thousand six hundred ninety-seven) is an odd 6-digit number. It is a prime number — divisible only by 1 and itself. Written other ways, in hexadecimal, 0x22981.
Interestingness
Properties
- Parity
- Odd
- Digit count
- 6
- Digit sum
- 28
- Digit product
- 1,512
- Digital root
- 1
- Palindrome
- No
- Bit width
- 18 bits
- Reversed
- 796,141
- Recamán's sequence
- a(485,433) = 141,697
- Square (n²)
- 20,078,039,809
- Cube (n³)
- 2,844,998,006,815,873
- Divisor count
- 2
- σ(n) — sum of divisors
- 141,698
- φ(n) — Euler's totient
- 141,696
Primality
141,697 is prime. It has exactly two divisors: 1 and itself.
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√141,697 = [376; (2, 2, 1, 9, 1, 2, 1, 7, 10, 5, 2, 3, 2, 6, 1, 4, 18, 6, 2, 1, 1, 1, 2, 1, …)]
Representations
- In words
- one hundred forty-one thousand six hundred ninety-seven
- Ordinal
- 141697th
- Binary
- 100010100110000001
- Octal
- 424601
- Hexadecimal
- 0x22981
- Base64
- AimB
- One's complement
- 4,294,825,598 (32-bit)
- Scientific notation
- 1.41697 × 10⁵
- As a duration
- 141,697 s = 1 day, 15 hours, 21 minutes, 37 seconds
As an angle
Historical numeral systems
- Babylonian (base 60)
- 𒌋𒌋𒌋𒁹𒁹𒁹𒁹𒁹𒁹𒁹𒁹𒁹 𒌋𒌋𒁹 𒌋𒌋𒌋𒁹𒁹𒁹𒁹𒁹𒁹𒁹
- Egyptian hieroglyphic
- 𓆐𓂍𓂍𓂍𓂍𓆼𓍢𓍢𓍢𓍢𓍢𓍢𓎆𓎆𓎆𓎆𓎆𓎆𓎆𓎆𓎆𓏺𓏺𓏺𓏺𓏺𓏺𓏺
- Greek (Milesian)
- ͵ρμαχϟζʹ
- Mayan (base 20)
- 𝋱·𝋮·𝋤·𝋱
- Chinese
- 一十四萬一千六百九十七
- Chinese (financial)
- 壹拾肆萬壹仟陸佰玖拾柒
Also seen as
UTF-8 encoding: F0 A2 A6 81 (4 bytes).
As an unsigned 32-bit integer, this is the IPv4 address 0.2.41.129.
- Address
- 0.2.41.129
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.2.41.129
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 141,697 and was likely granted around 1872.
Patent numbers below 100,000 are excluded as too ambiguous; modern numbering currently reaches roughly 12.5 million.
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.