Base | Representation |
---|---|
bin | 1100111100011111110101… |
… | …10110001001011011100000 |
3 | 10201210102012011101120020220 |
4 | 12132033322312021123200 |
5 | 12212400311413101432 |
6 | 140313312302203040 |
7 | 5665445504053200 |
oct | 636177266113340 |
9 | 121712164346226 |
10 | 28466956768992 |
11 | 908584aa67195 |
12 | 3239106283480 |
13 | 12b6565320c61 |
14 | 705b45458400 |
15 | 345756a7272c |
hex | 19e3fad896e0 |
28466956768992 has 1152 divisors, whose sum is σ = 93258093035520. Its totient is φ = 7569758085120.
The previous prime is 28466956768979. The next prime is 28466956769033. The reversal of 28466956768992 is 29986765966482.
It is a junction number, because it is equal to n+sod(n) for n = 28466956768899 and 28466956768908.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 119108605609 + ... + 119108605847.
It is an arithmetic number, because the mean of its divisors is an integer number (80953205760).
Almost surely, 228466956768992 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 28466956768992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (46629046517760).
28466956768992 is an abundant number, since it is smaller than the sum of its proper divisors (64791136266528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28466956768992 is a wasteful number, since it uses less digits than its factorization.
28466956768992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 604 (or 589 counting only the distinct ones).
The product of its digits is 33861058560, while the sum is 87.
The spelling of 28466956768992 in words is "twenty-eight trillion, four hundred sixty-six billion, nine hundred fifty-six million, seven hundred sixty-eight thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •