Base | Representation |
---|---|
bin | 1100010110100000101… |
… | …1011000000010110001 |
3 | 202021201200000101010022 |
4 | 3011220023120002301 |
5 | 11434042002210113 |
6 | 241252304213225 |
7 | 21221354344631 |
oct | 3055013300261 |
9 | 667650011108 |
10 | 212201210033 |
11 | 81aa306195a |
12 | 3516190a215 |
13 | 1701a072997 |
14 | a3b07186c1 |
15 | 57be6dc908 |
hex | 31682d80b1 |
212201210033 has 2 divisors, whose sum is σ = 212201210034. Its totient is φ = 212201210032.
The previous prime is 212201209999. The next prime is 212201210047. The reversal of 212201210033 is 330012102212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 177086947489 + 35114262544 = 420817^2 + 187388^2 .
It is a cyclic number.
It is not a de Polignac number, because 212201210033 - 210 = 212201209009 is a prime.
It is a super-2 number, since 2×2122012100332 (a number of 23 digits) contains 22 as substring.
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 = 212201209993 and 212201210020.
It is not a weakly prime, because it can be changed into another prime (212201210063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106100605016 + 106100605017.
It is an arithmetic number, because the mean of its divisors is an integer number (106100605017).
Almost surely, 2212201210033 is an apocalyptic number.
It is an amenable number.
212201210033 is a deficient number, since it is larger than the sum of its proper divisors (1).
212201210033 is an equidigital number, since it uses as much as digits as its factorization.
212201210033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 212201210033 its reverse (330012102212), we get a palindrome (542213312245).
The spelling of 212201210033 in words is "two hundred twelve billion, two hundred one million, two hundred ten thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •