Base | Representation |
---|---|
bin | 101111110010110110000011… |
… | …100101101010011100101011 |
3 | 1000120021010121212211101102021 |
4 | 233302312003211222130223 |
5 | 210022423102220401102 |
6 | 2023021320351445311 |
7 | 62163415344444013 |
oct | 5762660345523453 |
9 | 1016233555741367 |
10 | 210202202122027 |
11 | 60a82287157425 |
12 | 1b6aa718226837 |
13 | 9039ca0a2ba4b |
14 | 39c9bab4a4c43 |
15 | 1947c95942137 |
hex | bf2d8396a72b |
210202202122027 has 2 divisors, whose sum is σ = 210202202122028. Its totient is φ = 210202202122026.
The previous prime is 210202202121979. The next prime is 210202202122049. The reversal of 210202202122027 is 720221202202012.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 210202202122027 - 239 = 209652446308139 is a prime.
It is a super-3 number, since 3×2102022021220273 (a number of 44 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210202202121992 and 210202202122010.
It is not a weakly prime, because it can be changed into another prime (210202202162027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105101101061013 + 105101101061014.
It is an arithmetic number, because the mean of its divisors is an integer number (105101101061014).
Almost surely, 2210202202122027 is an apocalyptic number.
210202202122027 is a deficient number, since it is larger than the sum of its proper divisors (1).
210202202122027 is an equidigital number, since it uses as much as digits as its factorization.
210202202122027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1792, while the sum is 25.
Adding to 210202202122027 its reverse (720221202202012), we get a palindrome (930423404324039).
The spelling of 210202202122027 in words is "two hundred ten trillion, two hundred two billion, two hundred two million, one hundred twenty-two thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •