Base | Representation |
---|---|
bin | 1100010110010000011… |
… | …1001011100001101001 |
3 | 202021112220200000100201 |
4 | 3011210013023201221 |
5 | 11433422022020241 |
6 | 241241430232201 |
7 | 21216565521463 |
oct | 3054407134151 |
9 | 667486600321 |
10 | 212133001321 |
11 | 81a6860471a |
12 | 35142ab5661 |
13 | 17008bb05b7 |
14 | a3a5641133 |
15 | 57b8717931 |
hex | 31641cb869 |
212133001321 has 4 divisors (see below), whose sum is σ = 215120790144. Its totient is φ = 209145212500.
The previous prime is 212133001309. The next prime is 212133001337. The reversal of 212133001321 is 123100331212.
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 212133001321 - 213 = 212132993129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212133001361) 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, 1493894305 + ... + 1493894446.
It is an arithmetic number, because the mean of its divisors is an integer number (53780197536).
Almost surely, 2212133001321 is an apocalyptic number.
It is an amenable number.
212133001321 is a deficient number, since it is larger than the sum of its proper divisors (2987788823).
212133001321 is an equidigital number, since it uses as much as digits as its factorization.
212133001321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2987788822.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 212133001321 its reverse (123100331212), we get a palindrome (335233332533).
The spelling of 212133001321 in words is "two hundred twelve billion, one hundred thirty-three million, one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •