1,000,146
1,000,146 is a composite number, even.
Interestingness
Properties
- Parity
- Even
- Digit count
- 7
- Digit sum
- 12
- Digit product
- 0
- Digital root
- 3
- Palindrome
- No
- Bit width
- 20 bits
- Reversed
- 6,410,001
- Square (n²)
- 1,000,292,021,316
- Cube (n³)
- 1,000,438,063,951,112,136
- Divisor count
- 16
- σ(n) — sum of divisors
- 2,286,144
- φ(n) — Euler's totient
- 285,744
- Sum of prime factors
- 23,825
Primality
Prime factorization: 2 × 3 × 7 × 23813
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√1,000,146 = [1000; (13, 1, 2, 3, 11, 5, 9, 2, 1, 2, 10, 2, 3, 1, 1, 4, 1, 3, 2, 1, 2, 1, 14, 1, …)]
Representations
- In words
- one million one hundred forty-six
- Ordinal
- 1000146th
- Binary
- 11110100001011010010
- Octal
- 3641322
- Hexadecimal
- 0xF42D2
- Base64
- D0LS
- One's complement
- 4,293,967,149 (32-bit)
- Scientific notation
- 1.000146 × 10⁶
- As a duration
- 1,000,146 s = 11 days, 13 hours, 49 minutes, 6 seconds
Historical numeral systems
- Babylonian (base 60)
- 𒁹𒁹𒁹𒁹 𒌋𒌋𒌋𒁹𒁹𒁹𒁹𒁹𒁹𒁹 𒌋𒌋𒌋𒌋𒁹𒁹𒁹𒁹𒁹𒁹𒁹𒁹𒁹 𒁹𒁹𒁹𒁹𒁹𒁹
- Egyptian hieroglyphic
- 𓁨𓍢𓎆𓎆𓎆𓎆𓏺𓏺𓏺𓏺𓏺𓏺
- Chinese
- 一百萬零一百四十六
- Chinese (financial)
- 壹佰萬零壹佰肆拾陸
Also seen as
Goldbach's conjecture says every even integer greater than 2 is the sum of two primes. For 1000146, here are decompositions:
- 13 + 1000133 = 1000146
- 29 + 1000117 = 1000146
- 47 + 1000099 = 1000146
- 107 + 1000039 = 1000146
- 109 + 1000037 = 1000146
- 113 + 1000033 = 1000146
- 163 + 999983 = 1000146
- 167 + 999979 = 1000146
Showing the first eight; more decompositions exist.
As an unsigned 32-bit integer, this is the IPv4 address 0.15.66.210.
- Address
- 0.15.66.210
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.15.66.210
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 1,000,146 and was likely granted around 1911.
Patent numbers below 100,000 are excluded as too ambiguous; modern numbering currently reaches roughly 12.5 million.