Base | Representation |
---|---|
bin | 11001000011111011010100… |
… | …001010001110010111011111 |
3 | 112110021000200201020012210012 |
4 | 121003323110022032113133 |
5 | 103421330112102400111 |
6 | 1030230455535233435 |
7 | 32134130245313213 |
oct | 3103732412162737 |
9 | 473230621205705 |
10 | 110221010200031 |
11 | 32135516890675 |
12 | 104416a137887b |
13 | 4966a48367053 |
14 | 1d30a2254c943 |
15 | cb217c44b48b |
hex | 643ed428e5df |
110221010200031 has 2 divisors, whose sum is σ = 110221010200032. Its totient is φ = 110221010200030.
The previous prime is 110221010199997. The next prime is 110221010200061. The reversal of 110221010200031 is 130002010122011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110221010200031 is a prime.
It is a super-2 number, since 2×1102210102000312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110221010199979 and 110221010200015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110221010200061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55110505100015 + 55110505100016.
It is an arithmetic number, because the mean of its divisors is an integer number (55110505100016).
Almost surely, 2110221010200031 is an apocalyptic number.
110221010200031 is a deficient number, since it is larger than the sum of its proper divisors (1).
110221010200031 is an equidigital number, since it uses as much as digits as its factorization.
110221010200031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 110221010200031 its reverse (130002010122011), we get a palindrome (240223020322042).
The spelling of 110221010200031 in words is "one hundred ten trillion, two hundred twenty-one billion, ten million, two hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •