Base | Representation |
---|---|
bin | 11010000111101110… |
… | …101010101111000000 |
3 | 2200101122022021100120 |
4 | 122013232222233000 |
5 | 424420010232400 |
6 | 20515023420240 |
7 | 2012013145230 |
oct | 320756525700 |
9 | 80348267316 |
10 | 28046961600 |
11 | 10992862409 |
12 | 5528a54680 |
13 | 284c881188 |
14 | 1500cd5cc0 |
15 | ae2440ca0 |
hex | 687baabc0 |
28046961600 has 672 divisors, whose sum is σ = 108578050560. Its totient is φ = 6206914560.
The previous prime is 28046961563. The next prime is 28046961617. The reversal of 28046961600 is 616964082.
It is a tau number, because it is divible by the number of its divisors (672).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 248203144 + ... + 248203256.
It is an arithmetic number, because the mean of its divisors is an integer number (161574480).
Almost surely, 228046961600 is an apocalyptic number.
28046961600 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 28046961600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (54289025280).
28046961600 is an abundant number, since it is smaller than the sum of its proper divisors (80531088960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28046961600 is a wasteful number, since it uses less digits than its factorization.
28046961600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 317 (or 302 counting only the distinct ones).
The product of its (nonzero) digits is 124416, while the sum is 42.
The spelling of 28046961600 in words is "twenty-eight billion, forty-six million, nine hundred sixty-one thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •