Base | Representation |
---|---|
bin | 10100011110100000… |
… | …01100000001000000 |
3 | 1001101010212112000000 |
4 | 22033100030001000 |
5 | 140003242220000 |
6 | 5014505000000 |
7 | 536265451425 |
oct | 121720140100 |
9 | 31333775000 |
10 | 10993320000 |
11 | 4731496033 |
12 | 2169783000 |
13 | 1062728ca0 |
14 | 764051d4c |
15 | 4451c0000 |
hex | 28f40c040 |
10993320000 has 980 divisors, whose sum is σ = 45532784220. Its totient is φ = 2612736000.
The previous prime is 10993319999. The next prime is 10993320017. The reversal of 10993320000 is 2339901.
It can be written as a sum of positive squares in 10 ways, for example, as 9915379776 + 1077940224 = 99576^2 + 32832^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 139 ways as a sum of consecutive naturals, for example, 379079986 + ... + 379080014.
Almost surely, 210993320000 is an apocalyptic number.
10993320000 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 10993320000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22766392110).
10993320000 is an abundant number, since it is smaller than the sum of its proper divisors (34539464220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10993320000 is an frugal number, since it uses more digits than its factorization.
10993320000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92 (or 52 counting only the distinct ones).
The product of its (nonzero) digits is 1458, while the sum is 27.
Adding to 10993320000 its reverse (2339901), we get a palindrome (10995659901).
The spelling of 10993320000 in words is "ten billion, nine hundred ninety-three million, three hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •