21,313
21,313 is a prime, odd.
21,313 (twenty-one thousand three hundred thirteen) is an odd 5-digit number. It is a prime number — divisible only by 1 and itself. Written other ways, in hexadecimal, 0x5341.
Interestingness
Properties
- Parity
- Odd
- Digit count
- 5
- Digit sum
- 10
- Digit product
- 18
- Digital root
- 1
- Palindrome
- No
- Bit width
- 15 bits
- Reversed
- 31,312
- Recamán's sequence
- a(41,213) = 21,313
- Square (n²)
- 454,243,969
- Cube (n³)
- 9,681,301,711,297
- Divisor count
- 2
- σ(n) — sum of divisors
- 21,314
- φ(n) — Euler's totient
- 21,312
Primality
21,313 is prime. It has exactly two divisors: 1 and itself.
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√21,313 = [145; (1, 96, 3, 32, 9, 10, 1, 2, 2, 1, 2, 3, 4, 3, 1, 3, 3, 2, 3, 11, 1, 6, 1, 35, …)]
Representations
- In words
- twenty-one thousand three hundred thirteen
- Ordinal
- 21313th
- Binary
- 101001101000001
- Octal
- 51501
- Hexadecimal
- 0x5341
- Base64
- U0E=
- One's complement
- 44,222 (16-bit)
- Scientific notation
- 2.1313 × 10⁴
- As a duration
- 21,313 s = 5 hours, 55 minutes, 13 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 21,313 = 8
- e — Euler's number (e)
- Digit 21,313 = 3
- φ — Golden ratio (φ)
- Digit 21,313 = 3
- √2 — Pythagoras's (√2)
- Digit 21,313 = 1
- ln 2 — Natural log of 2
- Digit 21,313 = 9
- γ — Euler-Mascheroni (γ)
- Digit 21,313 = 8
Also seen as
UTF-8 encoding: E5 8D 81 (3 bytes).
As an unsigned 32-bit integer, this is the IPv4 address 0.0.83.65.
- Address
- 0.0.83.65
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.0.83.65
Unspecified address (0.0.0.0/8) — "this network" placeholder.
The digit sequence 21313 first appears in π at position 14,955 of the decimal expansion (the 14,955ordinal-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.
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.