Base | Representation |
---|---|
bin | 110000001110100110111100… |
… | …010111100010101111111011 |
3 | 1000211000112021222021222210122 |
4 | 300032212330113202233323 |
5 | 210300203011232414321 |
6 | 2031042013301403455 |
7 | 62451310340520401 |
oct | 6016467427425773 |
9 | 1024015258258718 |
10 | 212110120201211 |
11 | 61648440177201 |
12 | 1b95844210958b |
13 | 9147b8b04302b |
14 | 3a54282755471 |
15 | 197c70e8ec8ab |
hex | c0e9bc5e2bfb |
212110120201211 has 2 divisors, whose sum is σ = 212110120201212. Its totient is φ = 212110120201210.
The previous prime is 212110120201183. The next prime is 212110120201241. The reversal of 212110120201211 is 112102021011212.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212110120201211 is a prime.
It is a super-2 number, since 2×2121101202012112 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 212110120201211.
It is not a weakly prime, because it can be changed into another prime (212110120201241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106055060100605 + 106055060100606.
It is an arithmetic number, because the mean of its divisors is an integer number (106055060100606).
Almost surely, 2212110120201211 is an apocalyptic number.
212110120201211 is a deficient number, since it is larger than the sum of its proper divisors (1).
212110120201211 is an equidigital number, since it uses as much as digits as its factorization.
212110120201211 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 212110120201211 its reverse (112102021011212), we get a palindrome (324212141212423).
The spelling of 212110120201211 in words is "two hundred twelve trillion, one hundred ten billion, one hundred twenty million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •