Base | Representation |
---|---|
bin | 10110101111001101010010… |
… | …101101000100101001101011 |
3 | 111010002000100101001020221222 |
4 | 112233031102231010221223 |
5 | 101101404233420200021 |
6 | 552403513133252255 |
7 | 30030561520266002 |
oct | 2657152255045153 |
9 | 433060311036858 |
10 | 100001111100011 |
11 | 29955262213050 |
12 | b270a7593408b |
13 | 43a50ab3b2084 |
14 | 1a9a1185ddc39 |
15 | b863d20e96ab |
hex | 5af352b44a6b |
100001111100011 has 8 divisors (see below), whose sum is σ = 109506920143104. Its totient is φ = 90564435214120.
The previous prime is 100001111099941. The next prime is 100001111100029. The reversal of 100001111100011 is 110001111100001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100001111100011 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100001111100071) 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, 17283286271 + ... + 17283292056.
It is an arithmetic number, because the mean of its divisors is an integer number (13688365017888).
Almost surely, 2100001111100011 is an apocalyptic number.
100001111100011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100001111100011 is a deficient number, since it is larger than the sum of its proper divisors (9505809043093).
100001111100011 is a wasteful number, since it uses less digits than its factorization.
100001111100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34566578601.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 100001111100011 its reverse (110001111100001), we get a palindrome (210002222200012).
The spelling of 100001111100011 in words is "one hundred trillion, one billion, one hundred eleven million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •