Base | Representation |
---|---|
bin | 101111101111111011101101… |
… | …111000100111001001111001 |
3 | 1000112120000011221210122121022 |
4 | 233233323231320213021321 |
5 | 210011133321213330012 |
6 | 2022345350520352225 |
7 | 62143103231532632 |
oct | 5757735570471171 |
9 | 1015500157718538 |
10 | 210002122011257 |
11 | 60a05444149884 |
12 | 1b677999915675 |
13 | 9024165c40c64 |
14 | 39c022a8cc889 |
15 | 1942985446472 |
hex | befeede27279 |
210002122011257 has 2 divisors, whose sum is σ = 210002122011258. Its totient is φ = 210002122011256.
The previous prime is 210002122011217. The next prime is 210002122011259. The reversal of 210002122011257 is 752110221200012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 209818817295376 + 183304715881 = 14485124^2 + 428141^2 .
It is a cyclic number.
It is not a de Polignac number, because 210002122011257 - 230 = 210001048269433 is a prime.
Together with 210002122011259, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (210002122011259) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105001061005628 + 105001061005629.
It is an arithmetic number, because the mean of its divisors is an integer number (105001061005629).
Almost surely, 2210002122011257 is an apocalyptic number.
It is an amenable number.
210002122011257 is a deficient number, since it is larger than the sum of its proper divisors (1).
210002122011257 is an equidigital number, since it uses as much as digits as its factorization.
210002122011257 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1120, while the sum is 26.
Adding to 210002122011257 its reverse (752110221200012), we get a palindrome (962112343211269).
The spelling of 210002122011257 in words is "two hundred ten trillion, two billion, one hundred twenty-two million, eleven thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •