Base | Representation |
---|---|
bin | 1010000000111011100111… |
… | …1101101000001100000000 |
3 | 1102222122121222000002221202 |
4 | 2200032321331220030000 |
5 | 2420401234001320000 |
6 | 35230234511440332 |
7 | 2214345563143601 |
oct | 240167175501400 |
9 | 42878558002852 |
10 | 11011121120000 |
11 | 35658768a3a81 |
12 | 129a0422260a8 |
13 | 61b462478331 |
14 | 2a0d26573da8 |
15 | 141657bc0dd5 |
hex | a03b9f68300 |
11011121120000 has 270 divisors, whose sum is σ = 27819830638908. Its totient is φ = 4348301568000.
The previous prime is 11011121119927. The next prime is 11011121120009. The reversal of 11011121120000 is 2112111011.
It is not an unprimeable number, because it can be changed into a prime (11011121120009) by changing a digit.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 998554487 + ... + 998565513.
Almost surely, 211011121120000 is an apocalyptic number.
11011121120000 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 11011121120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13909915319454).
11011121120000 is an abundant number, since it is smaller than the sum of its proper divisors (16808709518908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011121120000 is an frugal number, since it uses more digits than its factorization.
11011121120000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11221 (or 11113 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11011121120000 its reverse (2112111011), we get a palindrome (11013233231011).
The spelling of 11011121120000 in words is "eleven trillion, eleven billion, one hundred twenty-one million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •