Base | Representation |
---|---|
bin | 10100100000000001… |
… | …100101110001010000 |
3 | 2002211001200202210202 |
4 | 110200001211301100 |
5 | 330040100433430 |
6 | 14040124114332 |
7 | 1406323653221 |
oct | 244001456120 |
9 | 62731622722 |
10 | 22012124240 |
11 | 93762a7817 |
12 | 43239959a8 |
13 | 20ca5086b2 |
14 | 10cb619248 |
15 | 88c725d45 |
hex | 520065c50 |
22012124240 has 40 divisors (see below), whose sum is σ = 53403331968. Its totient is φ = 8422029440.
The previous prime is 22012124237. The next prime is 22012124261. The reversal of 22012124240 is 4242121022.
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×220121242402 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5979716 + ... + 5983395.
Almost surely, 222012124240 is an apocalyptic number.
22012124240 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22012124240 is an abundant number, since it is smaller than the sum of its proper divisors (31391207728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22012124240 is a wasteful number, since it uses less digits than its factorization.
22012124240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11963147 (or 11963141 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 20.
Adding to 22012124240 its reverse (4242121022), we get a palindrome (26254245262).
The spelling of 22012124240 in words is "twenty-two billion, twelve million, one hundred twenty-four thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •