Base | Representation |
---|---|
bin | 1010000111011101100110… |
… | …0011111011010100000000 |
3 | 1110101101020022202020201011 |
4 | 2201313121203323110000 |
5 | 2424221030010400300 |
6 | 35353552143450304 |
7 | 2225430151256455 |
oct | 241673143732400 |
9 | 43341208666634 |
10 | 11123320403200 |
11 | 35a9412424105 |
12 | 12b79355b6994 |
13 | 628c034b5535 |
14 | 2a652b88982c |
15 | 144522de2eba |
hex | a1dd98fb500 |
11123320403200 has 108 divisors (see below), whose sum is σ = 28420084137088. Its totient is φ = 4305801369600.
The previous prime is 11123320403197. The next prime is 11123320403203. The reversal of 11123320403200 is 230402332111.
It is an interprime number because it is at equal distance from previous prime (11123320403197) and next prime (11123320403203).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11123320403203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 27834162 + ... + 28230961.
Almost surely, 211123320403200 is an apocalyptic number.
11123320403200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11123320403200 is an abundant number, since it is smaller than the sum of its proper divisors (17296763733888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11123320403200 is an equidigital number, since it uses as much as digits as its factorization.
11123320403200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56065180 (or 56065161 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 11123320403200 its reverse (230402332111), we get a palindrome (11353722735311).
The spelling of 11123320403200 in words is "eleven trillion, one hundred twenty-three billion, three hundred twenty million, four hundred three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •