Base | Representation |
---|---|
bin | 101001111111… |
… | …100000000000 |
3 | 202201021010201 |
4 | 221333200000 |
5 | 10304224000 |
6 | 1031534544 |
7 | 162365203 |
oct | 51774000 |
9 | 22637121 |
10 | 11008000 |
11 | 6239523 |
12 | 382a454 |
13 | 2385613 |
14 | 166793a |
15 | e7696a |
hex | a7f800 |
11008000 has 96 divisors (see below), whose sum is σ = 28108080. Its totient is φ = 4300800.
The previous prime is 11007989. The next prime is 11008001. The reversal of 11008000 is 80011.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11008001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 255979 + ... + 256021.
Almost surely, 211008000 is an apocalyptic number.
11008000 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 11008000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14054040).
11008000 is an abundant number, since it is smaller than the sum of its proper divisors (17100080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11008000 is an frugal number, since it uses more digits than its factorization.
11008000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80 (or 50 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 11008000 is about 3317.8306165324. The cubic root of 11008000 is about 222.4519106608.
Adding to 11008000 its reverse (80011), we get a palindrome (11088011).
It can be divided in two parts, 1 and 1008000, that added together give a palindrome (1008001).
The spelling of 11008000 in words is "eleven million, eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •