Base | Representation |
---|---|
bin | 101111110000000011000100… |
… | …001011010101011101011001 |
3 | 1000112120202112211121022220122 |
4 | 233300003010023111131121 |
5 | 210011301001111223113 |
6 | 2022353133455003025 |
7 | 62143502610242546 |
oct | 5760030413253531 |
9 | 1015522484538818 |
10 | 210010012211033 |
11 | 60a08822a41741 |
12 | 1b679420209475 |
13 | 9024b227bb918 |
14 | 39c0778773bcd |
15 | 1942c97ea3408 |
hex | bf00c42d5759 |
210010012211033 has 2 divisors, whose sum is σ = 210010012211034. Its totient is φ = 210010012211032.
The previous prime is 210010012210919. The next prime is 210010012211137. The reversal of 210010012211033 is 330112210010012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 210007861755904 + 2150455129 = 14491648^2 + 46373^2 .
It is a cyclic number.
It is not a de Polignac number, because 210010012211033 - 28 = 210010012210777 is a prime.
It is not a weakly prime, because it can be changed into another prime (210010012291033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105005006105516 + 105005006105517.
It is an arithmetic number, because the mean of its divisors is an integer number (105005006105517).
Almost surely, 2210010012211033 is an apocalyptic number.
It is an amenable number.
210010012211033 is a deficient number, since it is larger than the sum of its proper divisors (1).
210010012211033 is an equidigital number, since it uses as much as digits as its factorization.
210010012211033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 210010012211033 its reverse (330112210010012), we get a palindrome (540122222221045).
The spelling of 210010012211033 in words is "two hundred ten trillion, ten billion, twelve million, two hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •