190,159
190,159 is a prime, odd.
190,159 (one hundred ninety thousand one hundred fifty-nine) is an odd 6-digit number. It is a prime number — divisible only by 1 and itself. Written other ways, in hexadecimal, 0x2E6CF.
Interestingness
Properties
- Parity
- Odd
- Digit count
- 6
- Digit sum
- 25
- Digit product
- 0
- Digital root
- 7
- Palindrome
- No
- Bit width
- 18 bits
- Reversed
- 951,091
- Recamán's sequence
- a(166,114) = 190,159
- Square (n²)
- 36,160,445,281
- Cube (n³)
- 6,876,234,114,189,679
- Divisor count
- 2
- σ(n) — sum of divisors
- 190,160
- φ(n) — Euler's totient
- 190,158
Primality
190,159 is prime. It has exactly two divisors: 1 and itself.
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√190,159 = [436; (13, 1, 5, 2, 1, 8, 4, 1, 1, 1, 6, 3, 1, 1, 2, 4, 1, 173, 1, 1, 1, 1, 2, 5, …)]
Representations
- In words
- one hundred ninety thousand one hundred fifty-nine
- Ordinal
- 190159th
- Binary
- 101110011011001111
- Octal
- 563317
- Hexadecimal
- 0x2E6CF
- Base64
- AubP
- One's complement
- 4,294,777,136 (32-bit)
- Scientific notation
- 1.90159 × 10⁵
- As a duration
- 190,159 s = 2 days, 4 hours, 49 minutes, 19 seconds
As an angle
Historical numeral systems
- Babylonian (base 60)
- 𒌋𒌋𒌋𒌋𒌋𒁹𒁹 𒌋𒌋𒌋𒌋𒁹𒁹𒁹𒁹𒁹𒁹𒁹𒁹𒁹 𒌋𒁹𒁹𒁹𒁹𒁹𒁹𒁹𒁹𒁹
- Egyptian hieroglyphic
- 𓆐𓂍𓂍𓂍𓂍𓂍𓂍𓂍𓂍𓂍𓍢𓎆𓎆𓎆𓎆𓎆𓏺𓏺𓏺𓏺𓏺𓏺𓏺𓏺𓏺
- Greek (Milesian)
- ͵ρϟρνθʹ
- Chinese
- 十九萬零一百五十九
- Chinese (financial)
- 壹拾玖萬零壹佰伍拾玖
Also seen as
UTF-8 encoding: F0 AE 9B 8F (4 bytes).
As an unsigned 32-bit integer, this is the IPv4 address 0.2.230.207.
- Address
- 0.2.230.207
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.2.230.207
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 190,159 and was likely granted around 1875.
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.