Base | Representation |
---|---|
bin | 110000001101001001111001… |
… | …111110001001111111001011 |
3 | 1000210122222102220012200011002 |
4 | 300031021321332021333023 |
5 | 210242033413313031443 |
6 | 2030524052412325215 |
7 | 62441142641034506 |
oct | 6015117176117713 |
9 | 1023588386180132 |
10 | 212010222002123 |
11 | 6160a037252696 |
12 | 1b94100247380b |
13 | 913b62a657a1c |
14 | 3a4d4c703413d |
15 | 1979d145c12b8 |
hex | c0d279f89fcb |
212010222002123 has 2 divisors, whose sum is σ = 212010222002124. Its totient is φ = 212010222002122.
The previous prime is 212010222002041. The next prime is 212010222002143. The reversal of 212010222002123 is 321200222010212.
It is an a-pointer prime, because the next prime (212010222002143) can be obtained adding 212010222002123 to its sum of digits (20).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 212010222002123 - 216 = 212010221936587 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 212010222002095 and 212010222002104.
It is not a weakly prime, because it can be changed into another prime (212010222002143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106005111001061 + 106005111001062.
It is an arithmetic number, because the mean of its divisors is an integer number (106005111001062).
Almost surely, 2212010222002123 is an apocalyptic number.
212010222002123 is a deficient number, since it is larger than the sum of its proper divisors (1).
212010222002123 is an equidigital number, since it uses as much as digits as its factorization.
212010222002123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 212010222002123 its reverse (321200222010212), we get a palindrome (533210444012335).
The spelling of 212010222002123 in words is "two hundred twelve trillion, ten billion, two hundred twenty-two million, two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •