Base | Representation |
---|---|
bin | 1101000101100111111101… |
… | …00010000001011100101000 |
3 | 10202220101122002122222221011 |
4 | 12202303332202001130220 |
5 | 12233020032102334023 |
6 | 141113334103353304 |
7 | 6030216613630564 |
oct | 642637642013450 |
9 | 122811562588834 |
10 | 28780551214888 |
11 | 9196843942940 |
12 | 3289a44452834 |
13 | 1309cc0724095 |
14 | 716db3c646a4 |
15 | 34d9ac95550d |
hex | 1a2cfe881728 |
28780551214888 has 128 divisors (see below), whose sum is σ = 60014055628800. Its totient is φ = 12830068742400.
The previous prime is 28780551214861. The next prime is 28780551214897. The reversal of 28780551214888 is 88841215508782.
It is a super-2 number, since 2×287805512148882 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1111076545 + ... + 1111102447.
It is an arithmetic number, because the mean of its divisors is an integer number (468859809600).
Almost surely, 228780551214888 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 28780551214888, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30007027814400).
28780551214888 is an abundant number, since it is smaller than the sum of its proper divisors (31233504413912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28780551214888 is a wasteful number, since it uses less digits than its factorization.
28780551214888 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27063 (or 27059 counting only the distinct ones).
The product of its (nonzero) digits is 91750400, while the sum is 67.
The spelling of 28780551214888 in words is "twenty-eight trillion, seven hundred eighty billion, five hundred fifty-one million, two hundred fourteen thousand, eight hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •