Base | Representation |
---|---|
bin | 1101000000100101111000… |
… | …01110000100000010100000 |
3 | 10202021212022121200220020120 |
4 | 12200102330032010002200 |
5 | 12222201421314311103 |
6 | 140502100212040240 |
7 | 6011555662540530 |
oct | 640227416040240 |
9 | 122255277626216 |
10 | 28607639994528 |
11 | 912a482a82831 |
12 | 3260428903080 |
13 | 12c68c55cb0ca |
14 | 70c88d6d54c0 |
15 | 34923c751253 |
hex | 1a04bc3840a0 |
28607639994528 has 48 divisors (see below), whose sum is σ = 85822919985600. Its totient is φ = 8173611426816.
The previous prime is 28607639994481. The next prime is 28607639994533. The reversal of 28607639994528 is 82549993670682.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Smith number, since the sum of its digits (78) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21285445753 + ... + 21285447096.
It is an arithmetic number, because the mean of its divisors is an integer number (1787977499700).
Almost surely, 228607639994528 is an apocalyptic number.
28607639994528 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
28607639994528 is an abundant number, since it is smaller than the sum of its proper divisors (57215279991072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28607639994528 is a wasteful number, since it uses less digits than its factorization.
28607639994528 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42570892869 (or 42570892861 counting only the distinct ones).
The product of its (nonzero) digits is 2821754880, while the sum is 78.
The spelling of 28607639994528 in words is "twenty-eight trillion, six hundred seven billion, six hundred thirty-nine million, nine hundred ninety-four thousand, five hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •