Base | Representation |
---|---|
bin | 11010001010010110… |
… | …111010001101110000 |
3 | 2200111201021222010020 |
4 | 122022112322031300 |
5 | 430012303041300 |
6 | 20523241003440 |
7 | 2013060054162 |
oct | 321226721560 |
9 | 80451258106 |
10 | 28091065200 |
11 | 10a05746070 |
12 | 553b783580 |
13 | 2858a53793 |
14 | 1506ad6932 |
15 | ae62538a0 |
hex | 68a5ba370 |
28091065200 has 240 divisors, whose sum is σ = 103940775936. Its totient is φ = 6409318400.
The previous prime is 28091065181. The next prime is 28091065213. The reversal of 28091065200 is 256019082.
It is a tau number, because it is divible by the number of its divisors (240).
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 161809 + ... + 286991.
Almost surely, 228091065200 is an apocalyptic number.
28091065200 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 28091065200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (51970387968).
28091065200 is an abundant number, since it is smaller than the sum of its proper divisors (75849710736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28091065200 is a wasteful number, since it uses less digits than its factorization.
28091065200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125232 (or 125221 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 33.
The spelling of 28091065200 in words is "twenty-eight billion, ninety-one million, sixty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •