Base | Representation |
---|---|
bin | 10100111111111000… |
… | …010101011100000000 |
3 | 2011012022100101010122 |
4 | 110333320111130000 |
5 | 332133410201320 |
6 | 14205135115412 |
7 | 1425503450126 |
oct | 247770253400 |
9 | 64168311118 |
10 | 22546568960 |
11 | 961aa4aa73 |
12 | 4452972b68 |
13 | 2184160886 |
14 | 113c5b9916 |
15 | 8be5e4d25 |
hex | 53fe15700 |
22546568960 has 72 divisors (see below), whose sum is σ = 54047570640. Its totient is φ = 9011699712.
The previous prime is 22546568917. The next prime is 22546569011. The reversal of 22546568960 is 6986564522.
It is a Smith number, since the sum of its digits (53) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
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, 1861484 + ... + 1873556.
Almost surely, 222546568960 is an apocalyptic number.
22546568960 is a gapful number since it is divisible by the number (20) 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 22546568960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27023785320).
22546568960 is an abundant number, since it is smaller than the sum of its proper divisors (31501001680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22546568960 is a wasteful number, since it uses less digits than its factorization.
22546568960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13553 (or 13539 counting only the distinct ones).
The product of its (nonzero) digits is 6220800, while the sum is 53.
The spelling of 22546568960 in words is "twenty-two billion, five hundred forty-six million, five hundred sixty-eight thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •