Base | Representation |
---|---|
bin | 110010000011000001100000… |
… | …111011100001000100100111 |
3 | 1001212100022200000212021201112 |
4 | 302003001200323201010213 |
5 | 212322241001202400403 |
6 | 2100045104431215235 |
7 | 64235300502524114 |
oct | 6203014073410447 |
9 | 1055308600767645 |
10 | 220110110200103 |
11 | 6415219aa49462 |
12 | 2082a99267751b |
13 | 95a83a9844c76 |
14 | 3c4d55994d90b |
15 | 1a6a880a399d8 |
hex | c83060ee1127 |
220110110200103 has 2 divisors, whose sum is σ = 220110110200104. Its totient is φ = 220110110200102.
The previous prime is 220110110200027. The next prime is 220110110200177. The reversal of 220110110200103 is 301002011011022.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 220110110200103 - 218 = 220110109937959 is a prime.
It is a super-2 number, since 2×2201101102001032 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220110110200003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110055055100051 + 110055055100052.
It is an arithmetic number, because the mean of its divisors is an integer number (110055055100052).
Almost surely, 2220110110200103 is an apocalyptic number.
220110110200103 is a deficient number, since it is larger than the sum of its proper divisors (1).
220110110200103 is an equidigital number, since it uses as much as digits as its factorization.
220110110200103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 220110110200103 its reverse (301002011011022), we get a palindrome (521112121211125).
The spelling of 220110110200103 in words is "two hundred twenty trillion, one hundred ten billion, one hundred ten million, two hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •