Base | Representation |
---|---|
bin | 101111110010111111010010… |
… | …110111011101011110101101 |
3 | 1000120022002020020001121100111 |
4 | 233302333102313131132231 |
5 | 210023103411230402112 |
6 | 2023030040555500021 |
7 | 62164216231163131 |
oct | 5762772267353655 |
9 | 1016262206047314 |
10 | 210212122122157 |
11 | 60a865077a0341 |
12 | 1b6b0626457611 |
13 | 903abc1c88bcc |
14 | 39ca46cb613c1 |
15 | 194817679b5a7 |
hex | bf2fd2ddd7ad |
210212122122157 has 2 divisors, whose sum is σ = 210212122122158. Its totient is φ = 210212122122156.
The previous prime is 210212122122113. The next prime is 210212122122193. The reversal of 210212122122157 is 751221221212012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 210113693099401 + 98429022756 = 14495299^2 + 313734^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210212122122157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210212122122257) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105106061061078 + 105106061061079.
It is an arithmetic number, because the mean of its divisors is an integer number (105106061061079).
Almost surely, 2210212122122157 is an apocalyptic number.
It is an amenable number.
210212122122157 is a deficient number, since it is larger than the sum of its proper divisors (1).
210212122122157 is an equidigital number, since it uses as much as digits as its factorization.
210212122122157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4480, while the sum is 31.
Adding to 210212122122157 its reverse (751221221212012), we get a palindrome (961433343334169).
The spelling of 210212122122157 in words is "two hundred ten trillion, two hundred twelve billion, one hundred twenty-two million, one hundred twenty-two thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •