Base | Representation |
---|---|
bin | 1100010101110011010… |
… | …1110101010011001001 |
3 | 202021020102010101021122 |
4 | 3011130311311103021 |
5 | 11433144304411241 |
6 | 241221351445025 |
7 | 21213554610362 |
oct | 3053465652311 |
9 | 667212111248 |
10 | 212011013321 |
11 | 81a05765298 |
12 | 3510a086775 |
13 | 16cb983b853 |
14 | a393368b69 |
15 | 57acb6d04b |
hex | 315cd754c9 |
212011013321 has 2 divisors, whose sum is σ = 212011013322. Its totient is φ = 212011013320.
The previous prime is 212011013311. The next prime is 212011013323. The reversal of 212011013321 is 123310110212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 212001310096 + 9703225 = 460436^2 + 3115^2 .
It is a cyclic number.
It is not a de Polignac number, because 212011013321 - 26 = 212011013257 is a prime.
It is a Sophie Germain prime.
Together with 212011013323, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 212011013321.
It is not a weakly prime, because it can be changed into another prime (212011013323) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106005506660 + 106005506661.
It is an arithmetic number, because the mean of its divisors is an integer number (106005506661).
Almost surely, 2212011013321 is an apocalyptic number.
It is an amenable number.
212011013321 is a deficient number, since it is larger than the sum of its proper divisors (1).
212011013321 is an equidigital number, since it uses as much as digits as its factorization.
212011013321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 212011013321 its reverse (123310110212), we get a palindrome (335321123533).
The spelling of 212011013321 in words is "two hundred twelve billion, eleven million, thirteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •