53,047
53,047 is a prime, odd.
53,047 (fifty-three thousand forty-seven) is an odd 5-digit number. It is a prime number — divisible only by 1 and itself. Written other ways, in hexadecimal, 0xCF37.
Interestingness
Properties
- Parity
- Odd
- Digit count
- 5
- Digit sum
- 19
- Digit product
- 0
- Digital root
- 1
- Palindrome
- No
- Bit width
- 16 bits
- Reversed
- 74,035
- Recamán's sequence
- a(61,030) = 53,047
- Square (n²)
- 2,813,984,209
- Cube (n³)
- 149,273,420,334,823
- Divisor count
- 2
- σ(n) — sum of divisors
- 53,048
- φ(n) — Euler's totient
- 53,046
Primality
53,047 is prime. It has exactly two divisors: 1 and itself.
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√53,047 = [230; (3, 7, 1, 1, 1, 1, 3, 1, 6, 1, 1, 8, 6, 2, 1, 2, 3, 3, 1, 13, 5, 4, 1, 1, …)]
Representations
- In words
- fifty-three thousand forty-seven
- Ordinal
- 53047th
- Binary
- 1100111100110111
- Octal
- 147467
- Hexadecimal
- 0xCF37
- Base64
- zzc=
- One's complement
- 12,488 (16-bit)
- Scientific notation
- 5.3047 × 10⁴
- As a duration
- 53,047 s = 14 hours, 44 minutes, 7 seconds
As an angle
Historical numeral systems
- Babylonian (base 60)
- 𒌋𒁹𒁹𒁹𒁹 𒌋𒌋𒌋𒌋𒁹𒁹𒁹𒁹 𒁹𒁹𒁹𒁹𒁹𒁹𒁹
- Egyptian hieroglyphic
- 𓂍𓂍𓂍𓂍𓂍𓆼𓆼𓆼𓎆𓎆𓎆𓎆𓏺𓏺𓏺𓏺𓏺𓏺𓏺
- Greek (Milesian)
- ͵νγμζʹ
- Mayan (base 20)
- 𝋦·𝋬·𝋬·𝋧
- Chinese
- 五萬三千零四十七
- Chinese (financial)
- 伍萬參仟零肆拾柒
Digit at this position in famous constants
- π — Pi (π)
- Digit 53,047 = 3
- e — Euler's number (e)
- Digit 53,047 = 6
- φ — Golden ratio (φ)
- Digit 53,047 = 7
- √2 — Pythagoras's (√2)
- Digit 53,047 = 2
- ln 2 — Natural log of 2
- Digit 53,047 = 2
- γ — Euler-Mascheroni (γ)
- Digit 53,047 = 8
Also seen as
UTF-8 encoding: EC BC B7 (3 bytes).
As an unsigned 32-bit integer, this is the IPv4 address 0.0.207.55.
- Address
- 0.0.207.55
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.0.207.55
Unspecified address (0.0.0.0/8) — "this network" placeholder.
The digit sequence 53047 first appears in π at position 214,423 of the decimal expansion (the 214,423ordinal-suffix:rd digit after the integer 3).
Search range: the first 1,000,000 fractional digits of π. Any 6-digit-or-shorter string is virtually guaranteed to appear in there — the more interesting signal is the position.
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.