Base | Representation |
---|---|
bin | 1010000000100101000010… |
… | …10100011011110000011001 |
3 | 2212221010222000211101210012 |
4 | 11000102201110123300121 |
5 | 10341103210420204144 |
6 | 114451150430331305 |
7 | 4431115156615121 |
oct | 500224124336031 |
9 | 85833860741705 |
10 | 22010118913049 |
11 | 7016491361a83 |
12 | 2575860359b35 |
13 | c3871206b807 |
14 | 56141c985c81 |
15 | 2828013aee9e |
hex | 1404a151bc19 |
22010118913049 has 2 divisors, whose sum is σ = 22010118913050. Its totient is φ = 22010118913048.
The previous prime is 22010118913043. The next prime is 22010118913067. The reversal of 22010118913049 is 94031981101022.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12210132490000 + 9799986423049 = 3494300^2 + 3130493^2 .
It is a cyclic number.
It is not a de Polignac number, because 22010118913049 - 232 = 22005823945753 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22010118912997 and 22010118913015.
It is not a weakly prime, because it can be changed into another prime (22010118913043) 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, 11005059456524 + 11005059456525.
It is an arithmetic number, because the mean of its divisors is an integer number (11005059456525).
Almost surely, 222010118913049 is an apocalyptic number.
It is an amenable number.
22010118913049 is a deficient number, since it is larger than the sum of its proper divisors (1).
22010118913049 is an equidigital number, since it uses as much as digits as its factorization.
22010118913049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 41.
The spelling of 22010118913049 in words is "twenty-two trillion, ten billion, one hundred eighteen million, nine hundred thirteen thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •