Base | Representation |
---|---|
bin | 1010000111011101111100… |
… | …0011000001100100111000 |
3 | 1110101101110201221021101101 |
4 | 2201313133003001210320 |
5 | 2424221222041111100 |
6 | 35354005232301144 |
7 | 2225432346501430 |
oct | 241673703014470 |
9 | 43341421837341 |
10 | 11123412441400 |
11 | 35a945a377836 |
12 | 12b79603a17b4 |
13 | 628c1959c0cc |
14 | 2a6539ba72c0 |
15 | 14452b02386a |
hex | a1ddf0c1938 |
11123412441400 has 48 divisors (see below), whose sum is σ = 29556495919440. Its totient is φ = 3813741408000.
The previous prime is 11123412441377. The next prime is 11123412441523. The reversal of 11123412441400 is 414421432111.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (28).
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, 3972645901 + ... + 3972648700.
It is an arithmetic number, because the mean of its divisors is an integer number (615760331655).
Almost surely, 211123412441400 is an apocalyptic number.
11123412441400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11123412441400 is an abundant number, since it is smaller than the sum of its proper divisors (18433083478040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11123412441400 is a wasteful number, since it uses less digits than its factorization.
11123412441400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7945294624 (or 7945294615 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 28.
Adding to 11123412441400 its reverse (414421432111), we get a palindrome (11537833873511).
The spelling of 11123412441400 in words is "eleven trillion, one hundred twenty-three billion, four hundred twelve million, four hundred forty-one thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •