142,903
142,903 is a prime, odd.
142,903 (one hundred forty-two thousand nine hundred three) is an odd 6-digit number. It is a prime number — divisible only by 1 and itself. Written other ways, in hexadecimal, 0x22E37.
Interestingness
Properties
- Parity
- Odd
- Digit count
- 6
- Digit sum
- 19
- Digit product
- 0
- Digital root
- 1
- Palindrome
- No
- Bit width
- 18 bits
- Reversed
- 309,241
- Recamán's sequence
- a(222,610) = 142,903
- Square (n²)
- 20,421,267,409
- Cube (n³)
- 2,918,260,376,548,327
- Divisor count
- 2
- σ(n) — sum of divisors
- 142,904
- φ(n) — Euler's totient
- 142,902
Primality
142,903 is prime. It has exactly two divisors: 1 and itself.
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√142,903 = [378; (39, 1, 3, 1, 3, 1, 1, 4, 1, 11, 1, 1, 2, 1, 6, 1, 2, 3, 2, 2, 2, 1, 1, 1, …)]
Representations
- In words
- one hundred forty-two thousand nine hundred three
- Ordinal
- 142903rd
- Binary
- 100010111000110111
- Octal
- 427067
- Hexadecimal
- 0x22E37
- Base64
- Ai43
- One's complement
- 4,294,824,392 (32-bit)
- Scientific notation
- 1.42903 × 10⁵
- As a duration
- 142,903 s = 1 day, 15 hours, 41 minutes, 43 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 B8 B7 (4 bytes).
As an unsigned 32-bit integer, this is the IPv4 address 0.2.46.55.
- Address
- 0.2.46.55
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.2.46.55
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 142,903 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.