109,042
109,042 is a composite number, even.
Properties
- Parity
- Even
- Digit count
- 6
- Digit sum
- 16
- Digit product
- 0
- Digital root
- 7
- Palindrome
- No
- Bit width
- 17 bits
- Reversed
- 240,901
- Square (n²)
- 11,890,157,764
- Cube (n³)
- 1,296,526,582,902,088
- Divisor count
- 4
- σ(n) — sum of divisors
- 163,566
- φ(n) — Euler's totient
- 54,520
- Sum of prime factors
- 54,523
Primality
Prime factorization: 2 × 54521
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√109,042 = [330; (4, 1, 1, 1, 5, 1, 3, 3, 38, 1, 1, 5, 2, 3, 1, 10, 1, 4, 3, 1, 1, 36, 8, 7, …)]
Representations
- In words
- one hundred nine thousand forty-two
- Ordinal
- 109042nd
- Binary
- 11010100111110010
- Octal
- 324762
- Hexadecimal
- 0x1A9F2
- Base64
- Aany
- One's complement
- 4,294,858,253 (32-bit)
- Scientific notation
- 1.09042 × 10⁵
Historical numeral systems
- Babylonian (base 60)
- 𒌋𒌋𒌋 𒌋𒁹𒁹𒁹𒁹𒁹𒁹𒁹 𒌋𒌋𒁹𒁹
- Egyptian hieroglyphic
- 𓆐𓆼𓆼𓆼𓆼𓆼𓆼𓆼𓆼𓆼𓎆𓎆𓎆𓎆𓏺𓏺
- Greek (Milesian)
- ͵ρθμβʹ
- Mayan (base 20)
- 𝋭·𝋬·𝋬·𝋢
- Chinese
- 一十萬九千零四十二
- Chinese (financial)
- 壹拾萬玖仟零肆拾貳
Also seen as
Goldbach's conjecture says every even integer greater than 2 is the sum of two primes. For 109042, here are decompositions:
- 5 + 109037 = 109042
- 29 + 109013 = 109042
- 41 + 109001 = 109042
- 71 + 108971 = 109042
- 83 + 108959 = 109042
- 113 + 108929 = 109042
- 149 + 108893 = 109042
- 173 + 108869 = 109042
Showing the first eight; more decompositions exist.
As an unsigned 32-bit integer, this is the IPv4 address 0.1.169.242.
- Address
- 0.1.169.242
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.1.169.242
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 109,042 and was likely granted around 1871.
Patent numbers below 100,000 are excluded as too ambiguous; modern numbering currently reaches roughly 12.5 million.
The digit sequence 109042 first appears in π at position 795,501 of the decimal expansion (the 795,501ordinal-suffix:st 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.