Base | Representation |
---|---|
bin | 110000010000000100001010… |
… | …111111011010110111010011 |
3 | 1000211101002200100100202002121 |
4 | 300100010022333122313103 |
5 | 210303323014210302311 |
6 | 2031200010355155111 |
7 | 62461453110654403 |
oct | 6020041277326723 |
9 | 1024332610322077 |
10 | 212210223525331 |
11 | 61686939964239 |
12 | 1b97391a5a5a97 |
13 | 915445208b2b5 |
14 | 3a5905b3d0803 |
15 | 198011cc46b71 |
hex | c1010afdadd3 |
212210223525331 has 2 divisors, whose sum is σ = 212210223525332. Its totient is φ = 212210223525330.
The previous prime is 212210223525301. The next prime is 212210223525359. The reversal of 212210223525331 is 133525322012212.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 212210223525331 - 225 = 212210189970899 is a prime.
It is a super-2 number, since 2×2122102235253312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (212210223525301) 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, 106105111762665 + 106105111762666.
It is an arithmetic number, because the mean of its divisors is an integer number (106105111762666).
Almost surely, 2212210223525331 is an apocalyptic number.
212210223525331 is a deficient number, since it is larger than the sum of its proper divisors (1).
212210223525331 is an equidigital number, since it uses as much as digits as its factorization.
212210223525331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43200, while the sum is 34.
Adding to 212210223525331 its reverse (133525322012212), we get a palindrome (345735545537543).
The spelling of 212210223525331 in words is "two hundred twelve trillion, two hundred ten billion, two hundred twenty-three million, five hundred twenty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •