Base | Representation |
---|---|
bin | 10100100000000110… |
… | …100111000001110001 |
3 | 2002211011011121211210 |
4 | 110200012213001301 |
5 | 330040420040423 |
6 | 14040212230333 |
7 | 1406341103460 |
oct | 244006470161 |
9 | 62734147753 |
10 | 22013440113 |
11 | 9377016415 |
12 | 432430b3a9 |
13 | 20ca879612 |
14 | 10cb87c9d7 |
15 | 88c8d5b93 |
hex | 5201a7071 |
22013440113 has 16 divisors (see below), whose sum is σ = 33674820480. Its totient is φ = 12530159616.
The previous prime is 22013440073. The next prime is 22013440121. The reversal of 22013440113 is 31104431022.
It is not a de Polignac number, because 22013440113 - 221 = 22011342961 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 22013440113.
It is not an unprimeable number, because it can be changed into a prime (22013440123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2034018 + ... + 2044811.
It is an arithmetic number, because the mean of its divisors is an integer number (2104676280).
Almost surely, 222013440113 is an apocalyptic number.
It is an amenable number.
22013440113 is a deficient number, since it is larger than the sum of its proper divisors (11661380367).
22013440113 is a wasteful number, since it uses less digits than its factorization.
22013440113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4079096.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 22013440113 its reverse (31104431022), we get a palindrome (53117871135).
Subtracting 22013440113 from its reverse (31104431022), we obtain a palindrome (9090990909).
The spelling of 22013440113 in words is "twenty-two billion, thirteen million, four hundred forty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •