Base | Representation |
---|---|
bin | 110000010000000100111111… |
… | …110101110100001010010001 |
3 | 1000211101011222010210111000102 |
4 | 300100010333311310022101 |
5 | 210303331323202344303 |
6 | 2031200234351502145 |
7 | 62461514065403534 |
oct | 6020047765641221 |
9 | 1024334863714012 |
10 | 212211110199953 |
11 | 61687254414a87 |
12 | 1b973b27527955 |
13 | 915456399a637 |
14 | 3a5910307ca1b |
15 | 19801709e0288 |
hex | c1013fd74291 |
212211110199953 has 2 divisors, whose sum is σ = 212211110199954. Its totient is φ = 212211110199952.
The previous prime is 212211110199941. The next prime is 212211110200039. The reversal of 212211110199953 is 359991011112212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 178037463652624 + 34173646547329 = 13343068^2 + 5845823^2 .
It is a cyclic number.
It is not a de Polignac number, because 212211110199953 - 242 = 207813063688849 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 212211110199898 and 212211110199907.
It is not a weakly prime, because it can be changed into another prime (212211110199353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106105555099976 + 106105555099977.
It is an arithmetic number, because the mean of its divisors is an integer number (106105555099977).
Almost surely, 2212211110199953 is an apocalyptic number.
It is an amenable number.
212211110199953 is a deficient number, since it is larger than the sum of its proper divisors (1).
212211110199953 is an equidigital number, since it uses as much as digits as its factorization.
212211110199953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 87480, while the sum is 47.
The spelling of 212211110199953 in words is "two hundred twelve trillion, two hundred eleven billion, one hundred ten million, one hundred ninety-nine thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •