Base | Representation |
---|---|
bin | 110000001110110001010001… |
… | …111110010101111011100101 |
3 | 1000211001120221112201220000101 |
4 | 300032301101332111323211 |
5 | 210300343224322041401 |
6 | 2031051050535144101 |
7 | 62452152402304546 |
oct | 6016612176257345 |
9 | 1024046845656011 |
10 | 212121220112101 |
11 | 61652116845583 |
12 | 1b95a61b515031 |
13 | 9148c3987c741 |
14 | 3a54a169d24cd |
15 | 197cb5e125101 |
hex | c0ec51f95ee5 |
212121220112101 has 2 divisors, whose sum is σ = 212121220112102. Its totient is φ = 212121220112100.
The previous prime is 212121220112063. The next prime is 212121220112141. The reversal of 212121220112101 is 101211022121212.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 112522217307201 + 99599002804900 = 10607649^2 + 9979930^2 .
It is a cyclic number.
It is not a de Polignac number, because 212121220112101 - 29 = 212121220111589 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212121220112141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106060610056050 + 106060610056051.
It is an arithmetic number, because the mean of its divisors is an integer number (106060610056051).
Almost surely, 2212121220112101 is an apocalyptic number.
It is an amenable number.
212121220112101 is a deficient number, since it is larger than the sum of its proper divisors (1).
212121220112101 is an equidigital number, since it uses as much as digits as its factorization.
212121220112101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 212121220112101 its reverse (101211022121212), we get a palindrome (313332242233313).
The spelling of 212121220112101 in words is "two hundred twelve trillion, one hundred twenty-one billion, two hundred twenty million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •