Base | Representation |
---|---|
bin | 101101100000001001011001… |
… | …110001000001001110011011 |
3 | 222020120101211100210102111011 |
4 | 231200021121301001032123 |
5 | 202212241220311241443 |
6 | 1545342225443514351 |
7 | 60103165124160166 |
oct | 5540113161011633 |
9 | 866511740712434 |
10 | 200121212212123 |
11 | 58845a25165374 |
12 | 1a5409b90889b7 |
13 | 8788470655117 |
14 | 375bcbdd58add |
15 | 182092a693b9d |
hex | b60259c4139b |
200121212212123 has 2 divisors, whose sum is σ = 200121212212124. Its totient is φ = 200121212212122.
The previous prime is 200121212212099. The next prime is 200121212212133. The reversal of 200121212212123 is 321212212121002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200121212212123 - 25 = 200121212212091 is a prime.
It is a super-2 number, since 2×2001212122121232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200121212212094 and 200121212212103.
It is not a weakly prime, because it can be changed into another prime (200121212212133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100060606106061 + 100060606106062.
It is an arithmetic number, because the mean of its divisors is an integer number (100060606106062).
Almost surely, 2200121212212123 is an apocalyptic number.
200121212212123 is a deficient number, since it is larger than the sum of its proper divisors (1).
200121212212123 is an equidigital number, since it uses as much as digits as its factorization.
200121212212123 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 22.
Adding to 200121212212123 its reverse (321212212121002), we get a palindrome (521333424333125).
The spelling of 200121212212123 in words is "two hundred trillion, one hundred twenty-one billion, two hundred twelve million, two hundred twelve thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •