Base | Representation |
---|---|
bin | 11010011110010110… |
… | …110000000000000000 |
3 | 2201101002121021000000 |
4 | 122132112300000000 |
5 | 431204200131210 |
6 | 21020424000000 |
7 | 2024302560420 |
oct | 323626600000 |
9 | 81332537000 |
10 | 28426567680 |
11 | 11068069045 |
12 | 5614000000 |
13 | 28b0401c64 |
14 | 15394ac480 |
15 | b15926ac0 |
hex | 69e5b0000 |
28426567680 has 952 divisors, whose sum is σ = 123777160992. Its totient is φ = 6115295232.
The previous prime is 28426567633. The next prime is 28426567733. The reversal of 28426567680 is 8676562482.
28426567680 is a `hidden beast` number, since 28 + 426 + 56 + 76 + 80 = 666.
It is a tau number, because it is divible by the number of its divisors (952).
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 1672151032 + ... + 1672151048.
Almost surely, 228426567680 is an apocalyptic number.
28426567680 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 28426567680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61888580496).
28426567680 is an abundant number, since it is smaller than the sum of its proper divisors (95350593312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28426567680 is an frugal number, since it uses more digits than its factorization.
28426567680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 79 (or 34 counting only the distinct ones).
The product of its (nonzero) digits is 7741440, while the sum is 54.
The spelling of 28426567680 in words is "twenty-eight billion, four hundred twenty-six million, five hundred sixty-seven thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •