Base | Representation |
---|---|
bin | 1100010110101000000… |
… | …1001110010001111001 |
3 | 202021210211010220100111 |
4 | 3011222001032101321 |
5 | 11434122404244113 |
6 | 241255330304321 |
7 | 21222211052656 |
oct | 3055201162171 |
9 | 667724126314 |
10 | 212232103033 |
11 | 82009542265 |
12 | 351701280a1 |
13 | 1702359b272 |
14 | a3b487ac2d |
15 | 57c229113d |
hex | 316a04e479 |
212232103033 has 2 divisors, whose sum is σ = 212232103034. Its totient is φ = 212232103032.
The previous prime is 212232103007. The next prime is 212232103159. The reversal of 212232103033 is 330301232212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 183721105129 + 28510997904 = 428627^2 + 168852^2 .
It is a cyclic number.
It is not a de Polignac number, because 212232103033 - 217 = 212231971961 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 212232102995 and 212232103013.
It is not a weakly prime, because it can be changed into another prime (212232113033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106116051516 + 106116051517.
It is an arithmetic number, because the mean of its divisors is an integer number (106116051517).
Almost surely, 2212232103033 is an apocalyptic number.
It is an amenable number.
212232103033 is a deficient number, since it is larger than the sum of its proper divisors (1).
212232103033 is an equidigital number, since it uses as much as digits as its factorization.
212232103033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 212232103033 its reverse (330301232212), we get a palindrome (542533335245).
The spelling of 212232103033 in words is "two hundred twelve billion, two hundred thirty-two million, one hundred three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •