Base | Representation |
---|---|
bin | 10110110000101001011001… |
… | …000000100001101111100011 |
3 | 111010102110121012001022112222 |
4 | 112300221121000201233203 |
5 | 101110014300241023021 |
6 | 552521150005341255 |
7 | 30040662225435656 |
oct | 2660513100415743 |
9 | 433373535038488 |
10 | 100100001111011 |
11 | 29993199030a70 |
12 | b288073a0782b |
13 | 43b150ac54295 |
14 | 1aa0c1a08189d |
15 | b88c6db786ab |
hex | 5b0a59021be3 |
100100001111011 has 32 divisors (see below), whose sum is σ = 110495649470976. Its totient is φ = 89923957920000.
The previous prime is 100100001110987. The next prime is 100100001111013. The reversal of 100100001111011 is 110111100001001.
It is a cyclic number.
It is not a de Polignac number, because 100100001111011 - 214 = 100100001094627 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100100001111011.
It is not an unprimeable number, because it can be changed into a prime (100100001111013) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1291124330 + ... + 1291201856.
It is an arithmetic number, because the mean of its divisors is an integer number (3452989045968).
Almost surely, 2100100001111011 is an apocalyptic number.
100100001111011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100100001111011 is a deficient number, since it is larger than the sum of its proper divisors (10395648359965).
100100001111011 is a wasteful number, since it uses less digits than its factorization.
100100001111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79883.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 100100001111011 its reverse (110111100001001), we get a palindrome (210211101112012).
The spelling of 100100001111011 in words is "one hundred trillion, one hundred billion, one million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •