Base | Representation |
---|---|
bin | 10100011111100110… |
… | …111000100111000000 |
3 | 2002210120112002121211 |
4 | 110133212320213000 |
5 | 330031302423040 |
6 | 14035314055504 |
7 | 1406210315032 |
oct | 243746704700 |
9 | 62716462554 |
10 | 22005123520 |
11 | 9372355aa6 |
12 | 432157a594 |
13 | 20c8c27063 |
14 | 10ca715c52 |
15 | 88bce18ea |
hex | 51f9b89c0 |
22005123520 has 56 divisors (see below), whose sum is σ = 52889499504. Its totient is φ = 8719773696.
The previous prime is 22005123509. The next prime is 22005123521. The reversal of 22005123520 is 2532150022.
It is a super-2 number, since 2×220051235202 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22005123491 and 22005123500.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22005123521) 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, 287097 + ... + 355576.
Almost surely, 222005123520 is an apocalyptic number.
22005123520 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22005123520 is an abundant number, since it is smaller than the sum of its proper divisors (30884375984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22005123520 is a wasteful number, since it uses less digits than its factorization.
22005123520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 642797 (or 642787 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 22.
Adding to 22005123520 its reverse (2532150022), we get a palindrome (24537273542).
The spelling of 22005123520 in words is "twenty-two billion, five million, one hundred twenty-three thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •