20,064
20,064 is a composite number, even.
Properties
- Parity
- Even
- Digit count
- 5
- Digit sum
- 12
- Digit product
- 0
- Digital root
- 3
- Palindrome
- No
- Bit width
- 15 bits
- Reversed
- 46,002
- Square (n²)
- 402,564,096
- Cube (n³)
- 8,077,046,022,144
- Divisor count
- 48
- σ(n) — sum of divisors
- 60,480
- φ(n) — Euler's totient
- 5,760
- Sum of prime factors
- 43
Primality
Prime factorization: 2 5 × 3 × 11 × 19
Divisors & multiples
Sums & aliquot sequence
Representations
- In words
- twenty thousand sixty-four
- Ordinal
- 20064th
- Binary
- 100111001100000
- Octal
- 47140
- Hexadecimal
- 0x4E60
- Base64
- TmA=
- One's complement
- 45,471 (16-bit)
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 20,064 = 4
- e — Euler's number (e)
- Digit 20,064 = 4
- φ — Golden ratio (φ)
- Digit 20,064 = 3
- √2 — Pythagoras's (√2)
- Digit 20,064 = 3
- ln 2 — Natural log of 2
- Digit 20,064 = 5
- γ — Euler-Mascheroni (γ)
- Digit 20,064 = 8
Also seen as
Goldbach's conjecture says every even integer greater than 2 is the sum of two primes. For 20064, here are decompositions:
- 13 + 20051 = 20064
- 17 + 20047 = 20064
- 41 + 20023 = 20064
- 43 + 20021 = 20064
- 53 + 20011 = 20064
- 67 + 19997 = 20064
- 71 + 19993 = 20064
- 73 + 19991 = 20064
Showing the first eight; more decompositions exist.
UTF-8 encoding: E4 B9 A0 (3 bytes).
As an unsigned 32-bit integer, this is the IPv4 address 0.0.78.96.
- Address
- 0.0.78.96
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.0.78.96
Unspecified address (0.0.0.0/8) — "this network" placeholder.
This passes the ABA routing number checksum and matches the Federal Reserve numbering scheme.
Banks operate many routing numbers per state and division; an unmatched checksum-valid number can still be a real RTN at a smaller institution.
The digit sequence 20064 first appears in π at position 139,269 of the decimal expansion (the 139,269ordinal-suffix:th 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.