Base | Representation |
---|---|
bin | 110000010000000100000101… |
… | …100011000101110100001011 |
3 | 1000211101002102222112121010112 |
4 | 300100010011203011310023 |
5 | 210303322322321304003 |
6 | 2031155553334104535 |
7 | 62461450621554611 |
oct | 6020040543056413 |
9 | 1024332388477115 |
10 | 212210132213003 |
11 | 616868a2366a01 |
12 | 1b9738b3aab14b |
13 | 9154439199c32 |
14 | 3a5904d2216b1 |
15 | 1980114c0b3d8 |
hex | c101058c5d0b |
212210132213003 has 2 divisors, whose sum is σ = 212210132213004. Its totient is φ = 212210132213002.
The previous prime is 212210132212913. The next prime is 212210132213069. The reversal of 212210132213003 is 300312231012212.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 212210132213003 - 234 = 212192952343819 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 212210132213003.
It is not a weakly prime, because it can be changed into another prime (212210132213083) 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, 106105066106501 + 106105066106502.
It is an arithmetic number, because the mean of its divisors is an integer number (106105066106502).
Almost surely, 2212210132213003 is an apocalyptic number.
212210132213003 is a deficient number, since it is larger than the sum of its proper divisors (1).
212210132213003 is an equidigital number, since it uses as much as digits as its factorization.
212210132213003 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 212210132213003 its reverse (300312231012212), we get a palindrome (512522363225215).
The spelling of 212210132213003 in words is "two hundred twelve trillion, two hundred ten billion, one hundred thirty-two million, two hundred thirteen thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •