Base | Representation |
---|---|
bin | 10000000000100011000… |
… | …100111000011010110010 |
3 | 10220011112212102212211121 |
4 | 100000203010320122302 |
5 | 121011001112010002 |
6 | 2201213511132454 |
7 | 142323335435305 |
oct | 20004304703262 |
9 | 3804485385747 |
10 | 1100100110002 |
11 | 394605918133 |
12 | 15925937412a |
13 | 7c97b759b6a |
14 | 3b3608c6b3c |
15 | 1d939678237 |
hex | 100231386b2 |
1100100110002 has 8 divisors (see below), whose sum is σ = 1650214467756. Its totient is φ = 550028620752.
The previous prime is 1100100109909. The next prime is 1100100110017. The reversal of 1100100110002 is 2000110010011.
It can be written as a sum of positive squares in 2 ways, for example, as 1084765993441 + 15334116561 = 1041521^2 + 123831^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10652893 + ... + 10755664.
Almost surely, 21100100110002 is an apocalyptic number.
1100100110002 is a deficient number, since it is larger than the sum of its proper divisors (550114357754).
1100100110002 is a wasteful number, since it uses less digits than its factorization.
1100100110002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21434252.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 1100100110002 its reverse (2000110010011), we get a palindrome (3100210120013).
Subtracting 1100100110002 from its reverse (2000110010011), we obtain a palindrome (900009900009).
The spelling of 1100100110002 in words is "one trillion, one hundred billion, one hundred million, one hundred ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •