Base | Representation |
---|---|
bin | 11101001000101100011… |
… | …01110110100010111001 |
3 | 10112201000101110210201012 |
4 | 32210112031312202321 |
5 | 112400223112010014 |
6 | 2043522105403305 |
7 | 132220123350566 |
oct | 16442615664271 |
9 | 3481011423635 |
10 | 1001100110009 |
11 | 356622a0591a |
12 | 14202a499535 |
13 | 735321875cc |
14 | 3664c5b386d |
15 | 1b09311ec3e |
hex | e9163768b9 |
1001100110009 has 4 divisors (see below), whose sum is σ = 1001160972516. Its totient is φ = 1001039247504.
The previous prime is 1001100109991. The next prime is 1001100110069. The reversal of 1001100110009 is 9000110011001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 973916344384 + 27183765625 = 986872^2 + 164875^2 .
It is a cyclic number.
It is not a de Polignac number, because 1001100110009 - 224 = 1001083332793 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1001100109975 and 1001100110002.
It is not an unprimeable number, because it can be changed into a prime (1001100110069) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30406574 + ... + 30439479.
It is an arithmetic number, because the mean of its divisors is an integer number (250290243129).
Almost surely, 21001100110009 is an apocalyptic number.
It is an amenable number.
1001100110009 is a deficient number, since it is larger than the sum of its proper divisors (60862507).
1001100110009 is an equidigital number, since it uses as much as digits as its factorization.
1001100110009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60862506.
The product of its (nonzero) digits is 9, while the sum is 14.
The spelling of 1001100110009 in words is "one trillion, one billion, one hundred million, one hundred ten thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •