Base | Representation |
---|---|
bin | 10100011111101111… |
… | …01001100100111100 |
3 | 1001101212100002021001 |
4 | 22033313221210330 |
5 | 140013414232300 |
6 | 5015514420044 |
7 | 536452415050 |
oct | 121767514474 |
9 | 31355302231 |
10 | 11003664700 |
11 | 4737311176 |
12 | 2171131624 |
13 | 106490b702 |
14 | 765585c60 |
15 | 44606516a |
hex | 28fde993c |
11003664700 has 72 divisors (see below), whose sum is σ = 27372109184. Its totient is φ = 3761208000.
The previous prime is 11003664689. The next prime is 11003664701. The reversal of 11003664700 is 746630011.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11003664701) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 207955 + ... + 255445.
Almost surely, 211003664700 is an apocalyptic number.
11003664700 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 11003664700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13686054592).
11003664700 is an abundant number, since it is smaller than the sum of its proper divisors (16368444484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11003664700 is a wasteful number, since it uses less digits than its factorization.
11003664700 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47843 (or 47836 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 28.
It can be divided in two parts, 11003 and 664700, that added together give a triangular number (675703 = T1162).
The spelling of 11003664700 in words is "eleven billion, three million, six hundred sixty-four thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •