Base | Representation |
---|---|
bin | 1100010101110001000… |
… | …0000110011100110101 |
3 | 202021012201111212002011 |
4 | 3011130100012130311 |
5 | 11433134241401401 |
6 | 241220355444221 |
7 | 21213404543116 |
oct | 3053420063465 |
9 | 667181455064 |
10 | 212001122101 |
11 | 81a0011992a |
12 | 351068b6671 |
13 | 16cb7787662 |
14 | a391d1220d |
15 | 57abd67451 |
hex | 315c406735 |
212001122101 has 2 divisors, whose sum is σ = 212001122102. Its totient is φ = 212001122100.
The previous prime is 212001122071. The next prime is 212001122117. The reversal of 212001122101 is 101221100212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 177320999025 + 34680123076 = 421095^2 + 186226^2 .
It is a cyclic number.
It is not a de Polignac number, because 212001122101 - 219 = 212000597813 is a prime.
It is a super-2 number, since 2×2120011221012 (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 (212001122191) 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, 106000561050 + 106000561051.
It is an arithmetic number, because the mean of its divisors is an integer number (106000561051).
Almost surely, 2212001122101 is an apocalyptic number.
It is an amenable number.
212001122101 is a deficient number, since it is larger than the sum of its proper divisors (1).
212001122101 is an equidigital number, since it uses as much as digits as its factorization.
212001122101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 212001122101 its reverse (101221100212), we get a palindrome (313222222313).
The spelling of 212001122101 in words is "two hundred twelve billion, one million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •