Base | Representation |
---|---|
bin | 10100101000110111… |
… | …101010110001111100 |
3 | 2010012101220222010212 |
4 | 110220313222301330 |
5 | 330341043041033 |
6 | 14102544451552 |
7 | 1413105203660 |
oct | 245067526174 |
9 | 63171828125 |
10 | 22160518268 |
11 | 9442042409 |
12 | 4365619bb8 |
13 | 2122194605 |
14 | 11032068a0 |
15 | 89a789748 |
hex | 528deac7c |
22160518268 has 96 divisors (see below), whose sum is σ = 47003271168. Its totient is φ = 8942788800.
The previous prime is 22160518169. The next prime is 22160518277. The reversal of 22160518268 is 86281506122.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4824653 + ... + 4829243.
It is an arithmetic number, because the mean of its divisors is an integer number (489617408).
Almost surely, 222160518268 is an apocalyptic number.
22160518268 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22160518268, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23501635584).
22160518268 is an abundant number, since it is smaller than the sum of its proper divisors (24842752900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22160518268 is a wasteful number, since it uses less digits than its factorization.
22160518268 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4783 (or 4781 counting only the distinct ones).
The product of its (nonzero) digits is 92160, while the sum is 41.
The spelling of 22160518268 in words is "twenty-two billion, one hundred sixty million, five hundred eighteen thousand, two hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •