139,033
139,033 is a prime, odd.
139,033 (one hundred thirty-nine thousand thirty-three) is an odd 6-digit number. It is a prime number — divisible only by 1 and itself. Written other ways, in hexadecimal, 0x21F19.
Interestingness
Properties
- Parity
- Odd
- Digit count
- 6
- Digit sum
- 19
- Digit product
- 0
- Digital root
- 1
- Palindrome
- No
- Bit width
- 18 bits
- Reversed
- 330,931
- Recamán's sequence
- a(490,761) = 139,033
- Square (n²)
- 19,330,175,089
- Cube (n³)
- 2,687,532,233,148,937
- Divisor count
- 2
- σ(n) — sum of divisors
- 139,034
- φ(n) — Euler's totient
- 139,032
Primality
139,033 is prime. It has exactly two divisors: 1 and itself.
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√139,033 = [372; (1, 6, 1, 3, 2, 1, 21, 1, 9, 1, 1, 4, 1, 3, 3, 1, 9, 2, 4, 1, 1, 8, 46, 2, …)]
Representations
- In words
- one hundred thirty-nine thousand thirty-three
- Ordinal
- 139033rd
- Binary
- 100001111100011001
- Octal
- 417431
- Hexadecimal
- 0x21F19
- Base64
- Ah8Z
- One's complement
- 4,294,828,262 (32-bit)
- Scientific notation
- 1.39033 × 10⁵
- As a duration
- 139,033 s = 1 day, 14 hours, 37 minutes, 13 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 A1 BC 99 (4 bytes).
As an unsigned 32-bit integer, this is the IPv4 address 0.2.31.25.
- Address
- 0.2.31.25
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.2.31.25
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 139,033 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.