Base | Representation |
---|---|
bin | 101111001000010110… |
… | …1100001110111011111 |
3 | 100200020122102111202111 |
4 | 1132100231201313133 |
5 | 3124240244231421 |
6 | 114255102334451 |
7 | 10212062446621 |
oct | 1362055416737 |
9 | 320218374674 |
10 | 101212102111 |
11 | 39a1865838a |
12 | 1774788a427 |
13 | 970c980523 |
14 | 4c82020c11 |
15 | 2975865ee1 |
hex | 1790b61ddf |
101212102111 has 4 divisors (see below), whose sum is σ = 102431525112. Its totient is φ = 99992679112.
The previous prime is 101212102073. The next prime is 101212102127. The reversal of 101212102111 is 111201212101.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101212102111 - 213 = 101212093919 is a prime.
It is a super-2 number, since 2×1012121021112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101212102091 and 101212102100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101212102811) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 609711376 + ... + 609711541.
It is an arithmetic number, because the mean of its divisors is an integer number (25607881278).
Almost surely, 2101212102111 is an apocalyptic number.
101212102111 is a deficient number, since it is larger than the sum of its proper divisors (1219423001).
101212102111 is an equidigital number, since it uses as much as digits as its factorization.
101212102111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1219423000.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101212102111 its reverse (111201212101), we get a palindrome (212413314212).
The spelling of 101212102111 in words is "one hundred one billion, two hundred twelve million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •