Base | Representation |
---|---|
bin | 110000001110110001001010… |
… | …111100001100110100111011 |
3 | 1000211001120122022200202120121 |
4 | 300032301022330030310323 |
5 | 210300343004120010021 |
6 | 2031051031122034111 |
7 | 62452146440304253 |
oct | 6016611274146473 |
9 | 1024046568622517 |
10 | 212121102110011 |
11 | 61652066178896 |
12 | 1b95a5a7aa8937 |
13 | 9148c1b2a5013 |
14 | 3a54a05076963 |
15 | 197cb53ab6741 |
hex | c0ec4af0cd3b |
212121102110011 has 2 divisors, whose sum is σ = 212121102110012. Its totient is φ = 212121102110010.
The previous prime is 212121102109999. The next prime is 212121102110119. The reversal of 212121102110011 is 110011201121212.
212121102110011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 212121102110011 - 223 = 212121093721403 is a prime.
It is a super-3 number, since 3×2121211021100113 (a number of 44 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (212121102150011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106060551055005 + 106060551055006.
It is an arithmetic number, because the mean of its divisors is an integer number (106060551055006).
Almost surely, 2212121102110011 is an apocalyptic number.
212121102110011 is a deficient number, since it is larger than the sum of its proper divisors (1).
212121102110011 is an equidigital number, since it uses as much as digits as its factorization.
212121102110011 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 212121102110011 its reverse (110011201121212), we get a palindrome (322132303231223).
The spelling of 212121102110011 in words is "two hundred twelve trillion, one hundred twenty-one billion, one hundred two million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •