Base | Representation |
---|---|
bin | 101110100111110111… |
… | …1001100100100001111 |
3 | 100120102200020121101002 |
4 | 1131033233030210033 |
5 | 3120022214120421 |
6 | 113555002210515 |
7 | 10143055062161 |
oct | 1351757144417 |
9 | 316380217332 |
10 | 100122020111 |
11 | 395092a7673 |
12 | 174a27b3a3b |
13 | 9597b92ca9 |
14 | 4bbb344931 |
15 | 290ecddb0b |
hex | 174fbcc90f |
100122020111 has 2 divisors, whose sum is σ = 100122020112. Its totient is φ = 100122020110.
The previous prime is 100122020039. The next prime is 100122020113. The reversal of 100122020111 is 111020221001.
It is a strong prime.
It is an emirp because it is prime and its reverse (111020221001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100122020111 - 226 = 100054911247 is a prime.
It is a super-2 number, since 2×1001220201112 (a number of 23 digits) contains 22 as substring.
Together with 100122020113, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 100122020092 and 100122020101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100122020113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50061010055 + 50061010056.
It is an arithmetic number, because the mean of its divisors is an integer number (50061010056).
Almost surely, 2100122020111 is an apocalyptic number.
100122020111 is a deficient number, since it is larger than the sum of its proper divisors (1).
100122020111 is an equidigital number, since it uses as much as digits as its factorization.
100122020111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 100122020111 its reverse (111020221001), we get a palindrome (211142241112).
The spelling of 100122020111 in words is "one hundred billion, one hundred twenty-two million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •