Base | Representation |
---|---|
bin | 10101000110000011… |
… | …00011001001000000 |
3 | 1002020021000222022000 |
4 | 22203001203021000 |
5 | 141143201330010 |
6 | 5111434344000 |
7 | 550434066036 |
oct | 124301431100 |
9 | 32207028260 |
10 | 11325026880 |
11 | 4891756352 |
12 | 224088b000 |
13 | 10b637894b |
14 | 79611a556 |
15 | 4643937c0 |
hex | 2a3063240 |
11325026880 has 224 divisors, whose sum is σ = 40270663680. Its totient is φ = 2995937280.
The previous prime is 11325026863. The next prime is 11325026927. The reversal of 11325026880 is 8862052311.
It is a happy number.
11325026880 is a `hidden beast` number, since 1 + 13 + 2 + 502 + 68 + 80 = 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 31 ways as a sum of consecutive naturals, for example, 1092120 + ... + 1102440.
Almost surely, 211325026880 is an apocalyptic number.
11325026880 is a gapful number since it is divisible by the number (10) 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 11325026880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20135331840).
11325026880 is an abundant number, since it is smaller than the sum of its proper divisors (28945636800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11325026880 is a wasteful number, since it uses less digits than its factorization.
11325026880 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10474 (or 10458 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 36.
The spelling of 11325026880 in words is "eleven billion, three hundred twenty-five million, twenty-six thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •