Base | Representation |
---|---|
bin | 10101000000001111… |
… | …010110011010000000 |
3 | 2011012201200220020110 |
4 | 111000033112122000 |
5 | 332141431232430 |
6 | 14205512311320 |
7 | 1425605645640 |
oct | 250017263200 |
9 | 64181626213 |
10 | 22552602240 |
11 | 96233a0953 |
12 | 44549a2540 |
13 | 2185493a6c |
14 | 113d30a520 |
15 | 8bedd77b0 |
hex | 5403d6680 |
22552602240 has 128 divisors (see below), whose sum is σ = 82155957120. Its totient is φ = 5154877440.
The previous prime is 22552602227. The next prime is 22552602343. The reversal of 22552602240 is 4220625522.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 22552602198 and 22552602207.
It is an unprimeable number.
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, 825571 + ... + 852450.
It is an arithmetic number, because the mean of its divisors is an integer number (641843415).
Almost surely, 222552602240 is an apocalyptic number.
22552602240 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22552602240 is an abundant number, since it is smaller than the sum of its proper divisors (59603354880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22552602240 is a wasteful number, since it uses less digits than its factorization.
22552602240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1678050 (or 1678038 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 30.
The spelling of 22552602240 in words is "twenty-two billion, five hundred fifty-two million, six hundred two thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •