Base | Representation |
---|---|
bin | 11010010100100000… |
… | …100010010010100000 |
3 | 2200221120201212202200 |
4 | 122110200202102200 |
5 | 430334402021200 |
6 | 20552203013200 |
7 | 2020225413621 |
oct | 322440422240 |
9 | 80846655680 |
10 | 28261360800 |
11 | 10a9288a732 |
12 | 558880a200 |
13 | 288510a4ca |
14 | 1521585a48 |
15 | b06191800 |
hex | 6948224a0 |
28261360800 has 432 divisors, whose sum is σ = 103785357312. Its totient is φ = 7228569600.
The previous prime is 28261360723. The next prime is 28261360823. The reversal of 28261360800 is 806316282.
28261360800 is a `hidden beast` number, since 28 + 26 + 1 + 3 + 608 + 0 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 28345902 + ... + 28346898.
Almost surely, 228261360800 is an apocalyptic number.
28261360800 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 28261360800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (51892678656).
28261360800 is an abundant number, since it is smaller than the sum of its proper divisors (75523996512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28261360800 is a wasteful number, since it uses less digits than its factorization.
28261360800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1181 (or 1165 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 36.
The spelling of 28261360800 in words is "twenty-eight billion, two hundred sixty-one million, three hundred sixty thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •