Base | Representation |
---|---|
bin | 1010000001000011110010… |
… | …0111011101001110000000 |
3 | 1102222212021201122102001110 |
4 | 2200100330213131032000 |
5 | 2420420231124420300 |
6 | 35231240214003320 |
7 | 2214454110645513 |
oct | 240207447351600 |
9 | 42885251572043 |
10 | 11013313123200 |
11 | 35667a1161473 |
12 | 129a554346540 |
13 | 61b721639b4b |
14 | 2a109372cd7a |
15 | 14173535d550 |
hex | a043c9dd380 |
11013313123200 has 96 divisors (see below), whose sum is σ = 36275100131160. Its totient is φ = 2936883496960.
The previous prime is 11013313123171. The next prime is 11013313123229. The reversal of 11013313123200 is 232131331011.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (11013313123171) and next prime (11013313123229).
It is a tau number, because it is divible by the number of its divisors (96).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 573600459 + ... + 573619658.
Almost surely, 211013313123200 is an apocalyptic number.
11013313123200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11013313123200 is an abundant number, since it is smaller than the sum of its proper divisors (25261787007960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11013313123200 is a wasteful number, since it uses less digits than its factorization.
11013313123200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1147220144 (or 1147220127 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 11013313123200 its reverse (232131331011), we get a palindrome (11245444454211).
The spelling of 11013313123200 in words is "eleven trillion, thirteen billion, three hundred thirteen million, one hundred twenty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •