40,668
40,668 is a composite number, even.
Properties
- Parity
- Even
- Digit count
- 5
- Digit sum
- 24
- Digit product
- 0
- Digital root
- 6
- Palindrome
- No
- Bit width
- 16 bits
- Reversed
- 86,604
- Recamán's sequence
- a(152,843) = 40,668
- Square (n²)
- 1,653,886,224
- Cube (n³)
- 67,260,244,957,632
- Divisor count
- 12
- σ(n) — sum of divisors
- 94,920
- φ(n) — Euler's totient
- 13,552
- Sum of prime factors
- 3,396
Primality
Prime factorization: 2 2 × 3 × 3389
Divisors & multiples
Sums & aliquot sequence
Representations
- In words
- forty thousand six hundred sixty-eight
- Ordinal
- 40668th
- Binary
- 1001111011011100
- Octal
- 117334
- Hexadecimal
- 0x9EDC
- Base64
- ntw=
- One's complement
- 24,867 (16-bit)
- Scientific notation
- 4.0668 × 10⁴
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 40,668 = 1
- e — Euler's number (e)
- Digit 40,668 = 5
- φ — Golden ratio (φ)
- Digit 40,668 = 4
- √2 — Pythagoras's (√2)
- Digit 40,668 = 3
- ln 2 — Natural log of 2
- Digit 40,668 = 4
- γ — Euler-Mascheroni (γ)
- Digit 40,668 = 9
Also seen as
Goldbach's conjecture says every even integer greater than 2 is the sum of two primes. For 40668, here are decompositions:
- 29 + 40639 = 40668
- 31 + 40637 = 40668
- 41 + 40627 = 40668
- 59 + 40609 = 40668
- 71 + 40597 = 40668
- 109 + 40559 = 40668
- 137 + 40531 = 40668
- 139 + 40529 = 40668
Showing the first eight; more decompositions exist.
UTF-8 encoding: E9 BB 9C (3 bytes).
As an unsigned 32-bit integer, this is the IPv4 address 0.0.158.220.
- Address
- 0.0.158.220
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.0.158.220
Unspecified address (0.0.0.0/8) — "this network" placeholder.
The digit sequence 40668 first appears in π at position 347,303 of the decimal expansion (the 347,303ordinal-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.