Base | Representation |
---|---|
bin | 10110101111001101010010… |
… | …000110111101111011100011 |
3 | 111010002000022200020202122000 |
4 | 112233031102012331323203 |
5 | 101101404223341023021 |
6 | 552403512135215043 |
7 | 30030561336343362 |
oct | 2657152206757343 |
9 | 433060280222560 |
10 | 100001101111011 |
11 | 29955257610181 |
12 | b270a72517483 |
13 | 43a50a92c5519 |
14 | 1a9a11715d7d9 |
15 | b863d12c4b26 |
hex | 5af3521bdee3 |
100001101111011 has 16 divisors (see below), whose sum is σ = 148244082337920. Its totient is φ = 66624964429320.
The previous prime is 100001101111007. The next prime is 100001101111039. The reversal of 100001101111011 is 110111101100001.
It is not a de Polignac number, because 100001101111011 - 22 = 100001101111007 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 100001101110984 and 100001101111002.
It is not an unprimeable number, because it can be changed into a prime (100001101161011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1178743225 + ... + 1178828058.
It is an arithmetic number, because the mean of its divisors is an integer number (9265255146120).
Almost surely, 2100001101111011 is an apocalyptic number.
100001101111011 is a deficient number, since it is larger than the sum of its proper divisors (48242981226909).
100001101111011 is a wasteful number, since it uses less digits than its factorization.
100001101111011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2357572863 (or 2357572857 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 100001101111011 its reverse (110111101100001), we get a palindrome (210112202211012).
The spelling of 100001101111011 in words is "one hundred trillion, one billion, one hundred one million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.413 sec. • engine limits •