Base | Representation |
---|---|
bin | 101111110010111111010010… |
… | …110111011101011110000001 |
3 | 1000120022002020020001121021212 |
4 | 233302333102313131132001 |
5 | 210023103411230401423 |
6 | 2023030040555455505 |
7 | 62164216231163036 |
oct | 5762772267353601 |
9 | 1016262206047255 |
10 | 210212122122113 |
11 | 60a865077a0301 |
12 | 1b6b0626457595 |
13 | 903abc1c88b97 |
14 | 39ca46cb6138d |
15 | 194817679b578 |
hex | bf2fd2ddd781 |
210212122122113 has 2 divisors, whose sum is σ = 210212122122114. Its totient is φ = 210212122122112.
The previous prime is 210212122122089. The next prime is 210212122122157. The reversal of 210212122122113 is 311221221212012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 177112259572609 + 33099862549504 = 13308353^2 + 5753248^2 .
It is a cyclic number.
It is not a de Polignac number, because 210212122122113 - 236 = 210143402645377 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (210212122122193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105106061061056 + 105106061061057.
It is an arithmetic number, because the mean of its divisors is an integer number (105106061061057).
Almost surely, 2210212122122113 is an apocalyptic number.
It is an amenable number.
210212122122113 is a deficient number, since it is larger than the sum of its proper divisors (1).
210212122122113 is an equidigital number, since it uses as much as digits as its factorization.
210212122122113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 210212122122113 its reverse (311221221212012), we get a palindrome (521433343334125).
The spelling of 210212122122113 in words is "two hundred ten trillion, two hundred twelve billion, one hundred twenty-two million, one hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •