138,403
138,403 is a prime, odd.
138,403 (one hundred thirty-eight thousand four hundred three) is an odd 6-digit number. It is a prime number — divisible only by 1 and itself. Written other ways, in hexadecimal, 0x21CA3.
Interestingness
Properties
- Parity
- Odd
- Digit count
- 6
- Digit sum
- 19
- Digit product
- 0
- Digital root
- 1
- Palindrome
- No
- Bit width
- 18 bits
- Reversed
- 304,831
- Recamán's sequence
- a(492,021) = 138,403
- Square (n²)
- 19,155,390,409
- Cube (n³)
- 2,651,163,498,776,827
- Divisor count
- 2
- σ(n) — sum of divisors
- 138,404
- φ(n) — Euler's totient
- 138,402
Primality
138,403 is prime. It has exactly two divisors: 1 and itself.
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√138,403 = [372; (39, 6, 3, 1, 1, 2, 1, 12, 2, 1, 247, 2, 1, 12, 2, 1, 1, 2, 2, 1, 9, 1, 3, 2, …)]
Representations
- In words
- one hundred thirty-eight thousand four hundred three
- Ordinal
- 138403rd
- Binary
- 100001110010100011
- Octal
- 416243
- Hexadecimal
- 0x21CA3
- Base64
- Ahyj
- One's complement
- 4,294,828,892 (32-bit)
- Scientific notation
- 1.38403 × 10⁵
- As a duration
- 138,403 s = 1 day, 14 hours, 26 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 A1 B2 A3 (4 bytes).
As an unsigned 32-bit integer, this is the IPv4 address 0.2.28.163.
- Address
- 0.2.28.163
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.2.28.163
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 138,403 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.