Base | Representation |
---|---|
bin | 10100111000010101… |
… | …111100001010001011 |
3 | 2010212111101200210221 |
4 | 110320111330022023 |
5 | 331404022041021 |
6 | 14144420450511 |
7 | 1422406544023 |
oct | 247025741213 |
9 | 63774350727 |
10 | 22420112011 |
11 | 9565628aa0 |
12 | 4418549a37 |
13 | 2163bb598b |
14 | 112989ca83 |
15 | 8b3466241 |
hex | 53857c28b |
22420112011 has 8 divisors (see below), whose sum is σ = 24477033024. Its totient is φ = 20366312520.
The previous prime is 22420112003. The next prime is 22420112021. The reversal of 22420112011 is 11021102422.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22420112011 - 23 = 22420112003 is a prime.
It is a super-2 number, since 2×224201120112 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22420112021) 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 in 7 ways as a sum of consecutive naturals, for example, 765345 + ... + 794098.
It is an arithmetic number, because the mean of its divisors is an integer number (3059629128).
Almost surely, 222420112011 is an apocalyptic number.
22420112011 is a deficient number, since it is larger than the sum of its proper divisors (2056921013).
22420112011 is a wasteful number, since it uses less digits than its factorization.
22420112011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1560761.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 22420112011 its reverse (11021102422), we get a palindrome (33441214433).
It can be divided in two parts, 22420 and 112011, that added together give a palindrome (134431).
The spelling of 22420112011 in words is "twenty-two billion, four hundred twenty million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •