Base | Representation |
---|---|
bin | 101111110001101011010111… |
… | …001011100111010110011111 |
3 | 1000112222110121110202200000011 |
4 | 233301223113023213112133 |
5 | 210020114324022413434 |
6 | 2022520414142144051 |
7 | 62154546021404506 |
oct | 5761532713472637 |
9 | 1015873543680004 |
10 | 210122000201119 |
11 | 60a51270276166 |
12 | 1b697074882027 |
13 | 903255bb19506 |
14 | 39c5d5d9a783d |
15 | 1945b4e889e64 |
hex | bf1ad72e759f |
210122000201119 has 2 divisors, whose sum is σ = 210122000201120. Its totient is φ = 210122000201118.
The previous prime is 210122000201053. The next prime is 210122000201131. The reversal of 210122000201119 is 911102000221012.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 210122000201119 - 211 = 210122000199071 is a prime.
It is a super-2 number, since 2×2101220002011192 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 210122000201119.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210122000201149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105061000100559 + 105061000100560.
It is an arithmetic number, because the mean of its divisors is an integer number (105061000100560).
Almost surely, 2210122000201119 is an apocalyptic number.
210122000201119 is a deficient number, since it is larger than the sum of its proper divisors (1).
210122000201119 is an equidigital number, since it uses as much as digits as its factorization.
210122000201119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 210122000201119 in words is "two hundred ten trillion, one hundred twenty-two billion, two hundred one thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •