Base | Representation |
---|---|
bin | 1010000111010101010101… |
… | …0010000010100111010000 |
3 | 1110101011111122210002020011 |
4 | 2201311111102002213100 |
5 | 2424202003341401000 |
6 | 35352544024524304 |
7 | 2225321152554052 |
oct | 241652522024720 |
9 | 43334448702204 |
10 | 11121101122000 |
11 | 35a8483725311 |
12 | 12b7416320694 |
13 | 62893b7929ac |
14 | 2a639ac2d8d2 |
15 | 1444431682ba |
hex | a1d554829d0 |
11121101122000 has 40 divisors (see below), whose sum is σ = 26890822517832. Its totient is φ = 4448440448000.
The previous prime is 11121101121979. The next prime is 11121101122127. The reversal of 11121101122000 is 22110112111.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 44798262336 + 11076302859664 = 211656^2 + 3328108^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2780273281 + ... + 2780277280.
Almost surely, 211121101122000 is an apocalyptic number.
11121101122000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11121101122000 is an abundant number, since it is smaller than the sum of its proper divisors (15769721395832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11121101122000 is an equidigital number, since it uses as much as digits as its factorization.
11121101122000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5560550584 (or 5560550568 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11121101122000 its reverse (22110112111), we get a palindrome (11143211234111).
The spelling of 11121101122000 in words is "eleven trillion, one hundred twenty-one billion, one hundred one million, one hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •