Base | Representation |
---|---|
bin | 10101010000000000… |
… | …00000000000000000 |
3 | 1002110002010012022212 |
4 | 22220000000000000 |
5 | 141331034210010 |
6 | 5124015521252 |
7 | 552466465001 |
oct | 125000000000 |
9 | 32402105285 |
10 | 11408506880 |
11 | 4924894091 |
12 | 2264829228 |
13 | 10ca756cb4 |
14 | 7a324b1a8 |
15 | 46b883505 |
hex | 2a8000000 |
11408506880 has 112 divisors (see below), whose sum is σ = 28991029140. Its totient is φ = 4294967296.
The previous prime is 11408506873. The next prime is 11408506951. The reversal of 11408506880 is 8860580411.
It can be written as a sum of positive squares in 2 ways, for example, as 11341398016 + 67108864 = 106496^2 + 8192^2 .
It is a nialpdrome in base 4.
It is a zygodrome in base 4.
It is an unprimeable number.
In principle, a polygon with 11408506880 sides can be constructed with ruler and compass.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 671088632 + ... + 671088648.
Almost surely, 211408506880 is an apocalyptic number.
11408506880 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 11408506880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14495514570).
11408506880 is an abundant number, since it is smaller than the sum of its proper divisors (17582522260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11408506880 is an frugal number, since it uses more digits than its factorization.
11408506880 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76 (or 24 counting only the distinct ones).
The product of its (nonzero) digits is 61440, while the sum is 41.
The spelling of 11408506880 in words is "eleven billion, four hundred eight million, five hundred six thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •