Base | Representation |
---|---|
bin | 110000001110110000010101… |
… | …110101101110111011101101 |
3 | 1000211001111100020022222022201 |
4 | 300032300111311232323231 |
5 | 210300334143033103003 |
6 | 2031050402455141501 |
7 | 62452115402006665 |
oct | 6016602565567355 |
9 | 1024044306288281 |
10 | 212120211222253 |
11 | 616517492aa714 |
12 | 1b95a399674891 |
13 | 9148b0884c0b9 |
14 | 3a5495ca0d1a5 |
15 | 197cb00789b1d |
hex | c0ec15d6eeed |
212120211222253 has 2 divisors, whose sum is σ = 212120211222254. Its totient is φ = 212120211222252.
The previous prime is 212120211222209. The next prime is 212120211222347. The reversal of 212120211222253 is 352222112021212.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 112501087862409 + 99619123359844 = 10606653^2 + 9980938^2 .
It is a cyclic number.
It is not a de Polignac number, because 212120211222253 - 233 = 212111621287661 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212120211232253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106060105611126 + 106060105611127.
It is an arithmetic number, because the mean of its divisors is an integer number (106060105611127).
Almost surely, 2212120211222253 is an apocalyptic number.
It is an amenable number.
212120211222253 is a deficient number, since it is larger than the sum of its proper divisors (1).
212120211222253 is an equidigital number, since it uses as much as digits as its factorization.
212120211222253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3840, while the sum is 28.
Adding to 212120211222253 its reverse (352222112021212), we get a palindrome (564342323243465).
The spelling of 212120211222253 in words is "two hundred twelve trillion, one hundred twenty billion, two hundred eleven million, two hundred twenty-two thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •