Base | Representation |
---|---|
bin | 110000010000000100001001… |
… | …101001110111111011111111 |
3 | 1000211101002121210011102100221 |
4 | 300100010021221313323333 |
5 | 210303322442440200111 |
6 | 2031200004234402211 |
7 | 62461452416234461 |
oct | 6020041151677377 |
9 | 1024332553142327 |
10 | 212210201100031 |
11 | 61686928237832 |
12 | 1b973912b90367 |
13 | 915444a538ca4 |
14 | 3a59058434131 |
15 | 198011acb7371 |
hex | c10109a77eff |
212210201100031 has 2 divisors, whose sum is σ = 212210201100032. Its totient is φ = 212210201100030.
The previous prime is 212210201099983. The next prime is 212210201100133. The reversal of 212210201100031 is 130001102012212.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 212210201100031 - 217 = 212210200968959 is a prime.
It is a super-2 number, since 2×2122102011000312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 212210201099978 and 212210201100014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212210201109031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106105100550015 + 106105100550016.
It is an arithmetic number, because the mean of its divisors is an integer number (106105100550016).
Almost surely, 2212210201100031 is an apocalyptic number.
212210201100031 is a deficient number, since it is larger than the sum of its proper divisors (1).
212210201100031 is an equidigital number, since it uses as much as digits as its factorization.
212210201100031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 212210201100031 its reverse (130001102012212), we get a palindrome (342211303112243).
The spelling of 212210201100031 in words is "two hundred twelve trillion, two hundred ten billion, two hundred one million, one hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •