Base | Representation |
---|---|
bin | 10010101010100111… |
… | …11000111111000101 |
3 | 221212101200022122202 |
4 | 21111103320333011 |
5 | 131010412241401 |
6 | 4334221204245 |
7 | 503222616545 |
oct | 112523707705 |
9 | 27771608582 |
10 | 10021212101 |
11 | 4282792a7a |
12 | 1b38100685 |
13 | c39206504 |
14 | 6b0cc5325 |
15 | 3d9b9d06b |
hex | 2554f8fc5 |
10021212101 has 2 divisors, whose sum is σ = 10021212102. Its totient is φ = 10021212100.
The previous prime is 10021212083. The next prime is 10021212119. The reversal of 10021212101 is 10121212001.
It is a balanced prime because it is at equal distance from previous prime (10021212083) and next prime (10021212119).
It can be written as a sum of positive squares in only one way, i.e., 8399539201 + 1621672900 = 91649^2 + 40270^2 .
It is an emirp because it is prime and its reverse (10121212001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10021212101 - 210 = 10021211077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10021212151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5010606050 + 5010606051.
It is an arithmetic number, because the mean of its divisors is an integer number (5010606051).
Almost surely, 210021212101 is an apocalyptic number.
It is an amenable number.
10021212101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10021212101 is an equidigital number, since it uses as much as digits as its factorization.
10021212101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10021212101 its reverse (10121212001), we get a palindrome (20142424102).
The spelling of 10021212101 in words is "ten billion, twenty-one million, two hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •