Base | Representation |
---|---|
bin | 101111110011000111101010… |
… | …101101001010110111000011 |
3 | 1000120022221102202010100010222 |
4 | 233303013222231022313003 |
5 | 210023230314133342402 |
6 | 2023034125020213255 |
7 | 62164655062036151 |
oct | 5763075255126703 |
9 | 1016287382110128 |
10 | 210221112012227 |
11 | 60a8a300306858 |
12 | 1b6b231509a22b |
13 | 903b9c56095a4 |
14 | 39caa82aa43d1 |
15 | 1948500b2c7a2 |
hex | bf31eab4adc3 |
210221112012227 has 2 divisors, whose sum is σ = 210221112012228. Its totient is φ = 210221112012226.
The previous prime is 210221112012203. The next prime is 210221112012229. The reversal of 210221112012227 is 722210211122012.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 210221112012227 - 220 = 210221110963651 is a prime.
Together with 210221112012229, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 210221112012196 and 210221112012205.
It is not a weakly prime, because it can be changed into another prime (210221112012229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105110556006113 + 105110556006114.
It is an arithmetic number, because the mean of its divisors is an integer number (105110556006114).
Almost surely, 2210221112012227 is an apocalyptic number.
210221112012227 is a deficient number, since it is larger than the sum of its proper divisors (1).
210221112012227 is an equidigital number, since it uses as much as digits as its factorization.
210221112012227 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 896, while the sum is 26.
Adding to 210221112012227 its reverse (722210211122012), we get a palindrome (932431323134239).
The spelling of 210221112012227 in words is "two hundred ten trillion, two hundred twenty-one billion, one hundred twelve million, twelve thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •