Base | Representation |
---|---|
bin | 1100111111011010100111… |
… | …01011000110101010000000 |
3 | 10202011000000110121020010110 |
4 | 12133231103223012222000 |
5 | 12221021142202402310 |
6 | 140431334353231320 |
7 | 6005625423340323 |
oct | 637552353065200 |
9 | 122130013536113 |
10 | 28567231294080 |
11 | 9114327357026 |
12 | 325462bb62540 |
13 | 12c2b5597c07b |
14 | 70a938b3a7ba |
15 | 348174e37d20 |
hex | 19fb53ac6a80 |
28567231294080 has 256 divisors, whose sum is σ = 98765981112960. Its totient is φ = 6994941050880.
The previous prime is 28567231294073. The next prime is 28567231294181. The reversal of 28567231294080 is 8049213276582.
It is a self number, because there is not a number n which added to its sum of digits gives 28567231294080.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9335194 + ... + 12011673.
It is a 1-persistent number, because it is pandigital, but 2⋅28567231294080 = 57134462588160 is not.
Almost surely, 228567231294080 is an apocalyptic number.
28567231294080 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
28567231294080 is an abundant number, since it is smaller than the sum of its proper divisors (70198749818880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28567231294080 is a wasteful number, since it uses less digits than its factorization.
28567231294080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21346947 (or 21346935 counting only the distinct ones).
The product of its (nonzero) digits is 11612160, while the sum is 57.
The spelling of 28567231294080 in words is "twenty-eight trillion, five hundred sixty-seven billion, two hundred thirty-one million, two hundred ninety-four thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •