Base | Representation |
---|---|
bin | 10110110000110010111000… |
… | …111110011011111001011111 |
3 | 111010110102221001010221212102 |
4 | 112300302320332123321133 |
5 | 101110201142441010421 |
6 | 552525554054555315 |
7 | 30041503052132453 |
oct | 2660627076337137 |
9 | 433412831127772 |
10 | 100110201110111 |
11 | 29997552728295 |
12 | b28a03b968b3b |
13 | 43b24751c84ca |
14 | 1aa15069c6663 |
15 | b8916939060b |
hex | 5b0cb8f9be5f |
100110201110111 has 2 divisors, whose sum is σ = 100110201110112. Its totient is φ = 100110201110110.
The previous prime is 100110201109957. The next prime is 100110201110119. The reversal of 100110201110111 is 111011102011001.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100110201110111 - 242 = 95712154599007 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100110201110092 and 100110201110101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100110201110119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50055100555055 + 50055100555056.
It is an arithmetic number, because the mean of its divisors is an integer number (50055100555056).
Almost surely, 2100110201110111 is an apocalyptic number.
100110201110111 is a deficient number, since it is larger than the sum of its proper divisors (1).
100110201110111 is an equidigital number, since it uses as much as digits as its factorization.
100110201110111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 100110201110111 its reverse (111011102011001), we get a palindrome (211121303121112).
The spelling of 100110201110111 in words is "one hundred trillion, one hundred ten billion, two hundred one million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •