Base | Representation |
---|---|
bin | 10101000101001001… |
… | …00000001000110000 |
3 | 1002012201201010012020 |
4 | 22202210200020300 |
5 | 141134224144100 |
6 | 5111003231440 |
7 | 550312263300 |
oct | 124244401060 |
9 | 32181633166 |
10 | 11317412400 |
11 | 4888425498 |
12 | 223a218580 |
13 | 10b4910b38 |
14 | 7950d7600 |
15 | 46388c5a0 |
hex | 2a2920230 |
11317412400 has 360 divisors, whose sum is σ = 43633167120. Its totient is φ = 2497259520.
The previous prime is 11317412357. The next prime is 11317412413. The reversal of 11317412400 is 421471311.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1701882 + ... + 1708518.
It is an arithmetic number, because the mean of its divisors is an integer number (121203242).
Almost surely, 211317412400 is an apocalyptic number.
11317412400 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 11317412400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21816583560).
11317412400 is an abundant number, since it is smaller than the sum of its proper divisors (32315754720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11317412400 is a wasteful number, since it uses less digits than its factorization.
11317412400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6701 (or 6683 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 24.
Adding to 11317412400 its reverse (421471311), we get a palindrome (11738883711).
The spelling of 11317412400 in words is "eleven billion, three hundred seventeen million, four hundred twelve thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •