Base | Representation |
---|---|
bin | 1100110000110100111100… |
… | …10010010010001011100000 |
3 | 10200101002011211121221012010 |
4 | 12120122132102102023200 |
5 | 12134313102301431443 |
6 | 135405155101032520 |
7 | 5624461643002254 |
oct | 630323622221340 |
9 | 120332154557163 |
10 | 28065971905248 |
11 | 8a4079150a112 |
12 | 3193459255740 |
13 | 12877c0945104 |
14 | 6d0586568264 |
15 | 33a0d8987733 |
hex | 19869e4922e0 |
28065971905248 has 192 divisors, whose sum is σ = 77264427744000. Its totient is φ = 8912219197440.
The previous prime is 28065971905187. The next prime is 28065971905333. The reversal of 28065971905248 is 84250917956082.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 34195815 + ... + 35006937.
It is an arithmetic number, because the mean of its divisors is an integer number (402418894500).
Almost surely, 228065971905248 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 28065971905248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38632213872000).
28065971905248 is an abundant number, since it is smaller than the sum of its proper divisors (49198455838752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28065971905248 is a wasteful number, since it uses less digits than its factorization.
28065971905248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 811385 (or 811377 counting only the distinct ones).
The product of its (nonzero) digits is 87091200, while the sum is 66.
The spelling of 28065971905248 in words is "twenty-eight trillion, sixty-five billion, nine hundred seventy-one million, nine hundred five thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •