Base | Representation |
---|---|
bin | 1010000000010110010111… |
… | …0110011011011011100000 |
3 | 1102221200210222011011221100 |
4 | 2200011211312123123200 |
5 | 2420220243210341000 |
6 | 35221502245154400 |
7 | 2213543003135406 |
oct | 240054566333340 |
9 | 42850728134840 |
10 | 11001120012000 |
11 | 35616044a2568 |
12 | 12981109bba00 |
13 | 61a52a490751 |
14 | 2a0658203476 |
15 | 14126eb94a00 |
hex | a0165d9b6e0 |
11001120012000 has 144 divisors (see below), whose sum is σ = 39042975050352. Its totient is φ = 2933631993600.
The previous prime is 11001120011971. The next prime is 11001120012011. The reversal of 11001120012000 is 21002110011.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (144).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 152757334 + ... + 152829333.
It is an arithmetic number, because the mean of its divisors is an integer number (271131771183).
Almost surely, 211001120012000 is an apocalyptic number.
11001120012000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11001120012000 is an abundant number, since it is smaller than the sum of its proper divisors (28041855038352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11001120012000 is a wasteful number, since it uses less digits than its factorization.
11001120012000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 305586698 (or 305586677 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11001120012000 its reverse (21002110011), we get a palindrome (11022122122011).
The spelling of 11001120012000 in words is "eleven trillion, one billion, one hundred twenty million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •