Base | Representation |
---|---|
bin | 1010000111011101100010… |
… | …0101011100011111000000 |
3 | 1110101101012011221002200010 |
4 | 2201313120211130133000 |
5 | 2424221011312232000 |
6 | 35353550400424520 |
7 | 2225426562120630 |
oct | 241673045343700 |
9 | 43341164832603 |
10 | 11123304024000 |
11 | 35a9404157183 |
12 | 12b7930018140 |
13 | 628bccc9c1bc |
14 | 2a65296246c0 |
15 | 144521759d50 |
hex | a1dd895c7c0 |
11123304024000 has 224 divisors, whose sum is σ = 41976171933696. Its totient is φ = 2542469452800.
The previous prime is 11123304023999. The next prime is 11123304024011. The reversal of 11123304024000 is 42040332111.
It is a tau number, because it is divible by the number of its divisors (224).
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 32937072 + ... + 33273071.
It is an arithmetic number, because the mean of its divisors is an integer number (187393624704).
Almost surely, 211123304024000 is an apocalyptic number.
11123304024000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11123304024000 is an abundant number, since it is smaller than the sum of its proper divisors (30852867909696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11123304024000 is an equidigital number, since it uses as much as digits as its factorization.
11123304024000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66210180 (or 66210160 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 11123304024000 its reverse (42040332111), we get a palindrome (11165344356111).
The spelling of 11123304024000 in words is "eleven trillion, one hundred twenty-three billion, three hundred four million, twenty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •