Base | Representation |
---|---|
bin | 1100010110001000101… |
… | …0001011011101000101 |
3 | 202021110122000012201021 |
4 | 3011202022023131011 |
5 | 11433340124424104 |
6 | 241234300031141 |
7 | 21216020143216 |
oct | 3054212133505 |
9 | 667418005637 |
10 | 212100233029 |
11 | 81a51063393 |
12 | 35133b324b1 |
13 | 17002179589 |
14 | a3a115140d |
15 | 57b58e3754 |
hex | 316228b745 |
212100233029 has 2 divisors, whose sum is σ = 212100233030. Its totient is φ = 212100233028.
The previous prime is 212100233011. The next prime is 212100233041. The reversal of 212100233029 is 920332001212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 207934176004 + 4166057025 = 455998^2 + 64545^2 .
It is a cyclic number.
It is not a de Polignac number, because 212100233029 - 25 = 212100232997 is a prime.
It is a super-2 number, since 2×2121002330292 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 212100232994 and 212100233012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212100233129) 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, 106050116514 + 106050116515.
It is an arithmetic number, because the mean of its divisors is an integer number (106050116515).
Almost surely, 2212100233029 is an apocalyptic number.
It is an amenable number.
212100233029 is a deficient number, since it is larger than the sum of its proper divisors (1).
212100233029 is an equidigital number, since it uses as much as digits as its factorization.
212100233029 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 25.
The spelling of 212100233029 in words is "two hundred twelve billion, one hundred million, two hundred thirty-three thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •