Base | Representation |
---|---|
bin | 11010001011111000… |
… | …010110111000000000 |
3 | 2200120111100210202200 |
4 | 122023320112320000 |
5 | 430040323014220 |
6 | 20525552313200 |
7 | 2013520150353 |
oct | 321370267000 |
9 | 80514323680 |
10 | 28116610560 |
11 | 10a19103735 |
12 | 5548242800 |
13 | 2861128c8c |
14 | 150a26629a |
15 | ae85ec890 |
hex | 68be16e00 |
28116610560 has 240 divisors, whose sum is σ = 97895747664. Its totient is φ = 7457734656.
The previous prime is 28116610523. The next prime is 28116610591. The reversal of 28116610560 is 6501661182.
28116610560 is a `hidden beast` number, since 2 + 81 + 1 + 6 + 6 + 10 + 560 = 666.
It is a tau number, because it is divible by the number of its divisors (240).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4443559 + ... + 4449881.
Almost surely, 228116610560 is an apocalyptic number.
28116610560 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 28116610560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48947873832).
28116610560 is an abundant number, since it is smaller than the sum of its proper divisors (69779137104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28116610560 is a wasteful number, since it uses less digits than its factorization.
28116610560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6545 (or 6526 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 36.
The spelling of 28116610560 in words is "twenty-eight billion, one hundred sixteen million, six hundred ten thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •