Base | Representation |
---|---|
bin | 10110101111010110100110… |
… | …101100010001011100100011 |
3 | 111010002222011012221122102201 |
4 | 112233112212230101130203 |
5 | 101102040223142023021 |
6 | 552412245242554031 |
7 | 30031364353421401 |
oct | 2657264654213443 |
9 | 433088135848381 |
10 | 100011110111011 |
11 | 29959523412000 |
12 | b2729a6508917 |
13 | 43a6012b14328 |
14 | 1a9a7c6586471 |
15 | b867b9d5e591 |
hex | 5af5a6b11723 |
100011110111011 has 16 divisors (see below), whose sum is σ = 110006289358848. Its totient is φ = 90917883303720.
The previous prime is 100011110111009. The next prime is 100011110111039. The reversal of 100011110111011 is 110111011110001.
It is a happy number.
It is not a de Polignac number, because 100011110111011 - 21 = 100011110111009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100011110111041) 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, 98905366 + ... + 99911428.
It is an arithmetic number, because the mean of its divisors is an integer number (6875393084928).
Almost surely, 2100011110111011 is an apocalyptic number.
100011110111011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100011110111011 is a deficient number, since it is larger than the sum of its proper divisors (9995179247837).
100011110111011 is an equidigital number, since it uses as much as digits as its factorization.
100011110111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1080783 (or 1080761 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 10.
Adding to 100011110111011 its reverse (110111011110001), we get a palindrome (210122121221012).
The spelling of 100011110111011 in words is "one hundred trillion, eleven billion, one hundred ten million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.404 sec. • engine limits •