Base | Representation |
---|---|
bin | 1001001100100000110000… |
… | …01101000100110000010111 |
3 | 2122121010020001220111122222 |
4 | 10212100120031010300113 |
5 | 10122300314200010403 |
6 | 111001241202012555 |
7 | 4154633002654202 |
oct | 446203015046027 |
9 | 78533201814588 |
10 | 20221112110103 |
11 | 64967a8694013 |
12 | 2326ba164715b |
13 | b38ac550b648 |
14 | 4dc9c81d6939 |
15 | 250ee6a00338 |
hex | 126418344c17 |
20221112110103 has 2 divisors, whose sum is σ = 20221112110104. Its totient is φ = 20221112110102.
The previous prime is 20221112110013. The next prime is 20221112110123. The reversal of 20221112110103 is 30101121112202.
It is a happy number.
Together with previous prime (20221112110013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20221112110103 - 220 = 20221111061527 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20221112110123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10110556055051 + 10110556055052.
It is an arithmetic number, because the mean of its divisors is an integer number (10110556055052).
Almost surely, 220221112110103 is an apocalyptic number.
20221112110103 is a deficient number, since it is larger than the sum of its proper divisors (1).
20221112110103 is an equidigital number, since it uses as much as digits as its factorization.
20221112110103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 20221112110103 its reverse (30101121112202), we get a palindrome (50322233222305).
The spelling of 20221112110103 in words is "twenty trillion, two hundred twenty-one billion, one hundred twelve million, one hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •