Base | Representation |
---|---|
bin | 10000000001011001011… |
… | …000000010000101101001 |
3 | 10220020220100121222012020 |
4 | 100001121120002011221 |
5 | 121014332320200014 |
6 | 2201444132535053 |
7 | 142355036635662 |
oct | 20013130020551 |
9 | 3806810558166 |
10 | 1101011100009 |
11 | 394a33076437 |
12 | 159472481489 |
13 | 7ca954008c2 |
14 | 3b4098a4369 |
15 | 1d98e6261a9 |
hex | 10059602169 |
1101011100009 has 32 divisors (see below), whose sum is σ = 1523581589376. Its totient is φ = 706645555200.
The previous prime is 1101011099999. The next prime is 1101011100017. The reversal of 1101011100009 is 9000011101011.
It is not a de Polignac number, because 1101011100009 - 29 = 1101011099497 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1101011100019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 62988979 + ... + 63006455.
It is an arithmetic number, because the mean of its divisors is an integer number (47611924668).
Almost surely, 21101011100009 is an apocalyptic number.
It is an amenable number.
1101011100009 is a deficient number, since it is larger than the sum of its proper divisors (422570489367).
1101011100009 is a wasteful number, since it uses less digits than its factorization.
1101011100009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23465.
The product of its (nonzero) digits is 9, while the sum is 15.
The spelling of 1101011100009 in words is "one trillion, one hundred one billion, eleven million, one hundred thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •