Base | Representation |
---|---|
bin | 10010101001011100… |
… | …01111000000000000 |
3 | 221211201002210210000 |
4 | 21110232033000000 |
5 | 131000400401200 |
6 | 4333225440000 |
7 | 503042664336 |
oct | 112456170000 |
9 | 27751083700 |
10 | 10011340800 |
11 | 427816057a |
12 | 1b34940000 |
13 | c3715b3c6 |
14 | 6ad875b56 |
15 | 3d8d9d300 |
hex | 254b8f000 |
10011340800 has 780 divisors, whose sum is σ = 39818875536. Its totient is φ = 2477260800.
The previous prime is 10011340747. The next prime is 10011340813. The reversal of 10011340800 is 804311001.
It is a super-2 number, since 2×100113408002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 141004765 + ... + 141004835.
Almost surely, 210011340800 is an apocalyptic number.
10011340800 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 10011340800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19909437768).
10011340800 is an abundant number, since it is smaller than the sum of its proper divisors (29807534736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10011340800 is an equidigital number, since it uses as much as digits as its factorization.
10011340800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 134 (or 98 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 10011340800 its reverse (804311001), we get a palindrome (10815651801).
The spelling of 10011340800 in words is "ten billion, eleven million, three hundred forty thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •