Base | Representation |
---|---|
bin | 10110110000110011101001… |
… | …001100100001111000100011 |
3 | 111010110112000102102110110201 |
4 | 112300303221030201320203 |
5 | 101110204322042023021 |
6 | 552530210234410031 |
7 | 30041532104414614 |
oct | 2660635114417043 |
9 | 433415012373421 |
10 | 100111010111011 |
11 | 29997928356679 |
12 | b28a226890917 |
13 | 43b25739b0273 |
14 | 1aa1582215c0b |
15 | b891b53e4591 |
hex | 5b0ce9321e23 |
100111010111011 has 8 divisors (see below), whose sum is σ = 101495602063584. Its totient is φ = 98734131763200.
The previous prime is 100111010111009. The next prime is 100111010111069. The reversal of 100111010111011 is 110111010111001.
It is a happy number.
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 100111010111011 - 21 = 100111010111009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100111010111081) 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, 1928375055 + ... + 1928426968.
It is an arithmetic number, because the mean of its divisors is an integer number (12686950257948).
Almost surely, 2100111010111011 is an apocalyptic number.
100111010111011 is a deficient number, since it is larger than the sum of its proper divisors (1384591952573).
100111010111011 is a wasteful number, since it uses less digits than its factorization.
100111010111011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3856802381.
The product of its (nonzero) digits is 1, while the sum is 10.
Subtracting from 100111010111011 its sum of digits (10), we obtain a palindrome (100111010111001).
Adding to 100111010111011 its reverse (110111010111001), we get a palindrome (210222020222012).
The spelling of 100111010111011 in words is "one hundred trillion, one hundred eleven billion, ten million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •