Base | Representation |
---|---|
bin | 10110101111001101010010… |
… | …001010110010000100100011 |
3 | 111010002000022202010120101001 |
4 | 112233031102022302010203 |
5 | 101101404224120023021 |
6 | 552403512212452431 |
7 | 30030561351010003 |
oct | 2657152212620443 |
9 | 433060282116331 |
10 | 100001102111011 |
11 | 29955258133522 |
12 | b270a7291a117 |
13 | 43a50a958573a |
14 | 1a9a117340003 |
15 | b863d1421091 |
hex | 5af3522b2123 |
100001102111011 has 8 divisors (see below), whose sum is σ = 103294722852864. Its totient is φ = 96711717540360.
The previous prime is 100001102111003. The next prime is 100001102111081. The reversal of 100001102111011 is 110111201100001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100001102111011 - 23 = 100001102111003 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100001102111081) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1058994811 + ... + 1059089236.
It is an arithmetic number, because the mean of its divisors is an integer number (12911840356608).
Almost surely, 2100001102111011 is an apocalyptic number.
100001102111011 is a deficient number, since it is larger than the sum of its proper divisors (3293620741853).
100001102111011 is a wasteful number, since it uses less digits than its factorization.
100001102111011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2118085601.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 100001102111011 its reverse (110111201100001), we get a palindrome (210112303211012).
It can be divided in two parts, 10000110 and 2111011, that added together give a palindrome (12111121).
The spelling of 100001102111011 in words is "one hundred trillion, one billion, one hundred two million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •