Base | Representation |
---|---|
bin | 101111000101010100… |
… | …0110110011000000101 |
3 | 100122222112200221221102 |
4 | 1132022220312120011 |
5 | 3124033203241401 |
6 | 114241022425445 |
7 | 10206414423323 |
oct | 1361250663005 |
9 | 318875627842 |
10 | 101110212101 |
11 | 39976095968 |
12 | 17719732285 |
13 | 96c4827692 |
14 | 4c7269ad13 |
15 | 296b93b56b |
hex | 178aa36605 |
101110212101 has 2 divisors, whose sum is σ = 101110212102. Its totient is φ = 101110212100.
The previous prime is 101110212079. The next prime is 101110212107. The reversal of 101110212101 is 101212011101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99350409601 + 1759802500 = 315199^2 + 41950^2 .
It is a cyclic number.
It is not a de Polignac number, because 101110212101 - 234 = 83930342917 is a prime.
It is a super-2 number, since 2×1011102121012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101110212107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50555106050 + 50555106051.
It is an arithmetic number, because the mean of its divisors is an integer number (50555106051).
Almost surely, 2101110212101 is an apocalyptic number.
It is an amenable number.
101110212101 is a deficient number, since it is larger than the sum of its proper divisors (1).
101110212101 is an equidigital number, since it uses as much as digits as its factorization.
101110212101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 101110212101 its reverse (101212011101), we get a palindrome (202322223202).
The spelling of 101110212101 in words is "one hundred one billion, one hundred ten million, two hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •