Base | Representation |
---|---|
bin | 1100010110001000101… |
… | …0000110100111110001 |
3 | 202021110121222012120002 |
4 | 3011202022012213301 |
5 | 11433340123310413 |
6 | 241234255355345 |
7 | 21216020031416 |
oct | 3054212064761 |
9 | 667417865502 |
10 | 212100213233 |
11 | 81a5104a527 |
12 | 35133b22b55 |
13 | 1700217056c |
14 | a3a114810d |
15 | 57b58dc958 |
hex | 31622869f1 |
212100213233 has 4 divisors (see below), whose sum is σ = 212407160688. Its totient is φ = 211793265780.
The previous prime is 212100213197. The next prime is 212100213239. The reversal of 212100213233 is 332312001212.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 212100213233 - 212 = 212100209137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212100213239) 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 in 3 ways as a sum of consecutive naturals, for example, 153472691 + ... + 153474072.
It is an arithmetic number, because the mean of its divisors is an integer number (53101790172).
Almost surely, 2212100213233 is an apocalyptic number.
It is an amenable number.
212100213233 is a deficient number, since it is larger than the sum of its proper divisors (306947455).
212100213233 is an equidigital number, since it uses as much as digits as its factorization.
212100213233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306947454.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 212100213233 its reverse (332312001212), we get a palindrome (544412214445).
The spelling of 212100213233 in words is "two hundred twelve billion, one hundred million, two hundred thirteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •