Base | Representation |
---|---|
bin | 1010000111010001010001… |
… | …0011111100001111000001 |
3 | 1110101001200200201021200111 |
4 | 2201310110103330033001 |
5 | 2424142240320213441 |
6 | 35352243525551321 |
7 | 2225252145542446 |
oct | 241642423741701 |
9 | 43331620637614 |
10 | 11120011101121 |
11 | 35a7a7440650a |
12 | 12b7171275541 |
13 | 6287c69c7220 |
14 | 2a62d616b9cd |
15 | 1443cc604081 |
hex | a1d144fc3c1 |
11120011101121 has 32 divisors (see below), whose sum is σ = 12633128766720. Its totient is φ = 9710965718784.
The previous prime is 11120011101091. The next prime is 11120011101149. The reversal of 11120011101121 is 12110111002111.
It is a cyclic number.
It is not a de Polignac number, because 11120011101121 - 27 = 11120011100993 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11120011101421) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18045715 + ... + 18651751.
It is an arithmetic number, because the mean of its divisors is an integer number (394785273960).
Almost surely, 211120011101121 is an apocalyptic number.
It is an amenable number.
11120011101121 is a deficient number, since it is larger than the sum of its proper divisors (1513117665599).
11120011101121 is a wasteful number, since it uses less digits than its factorization.
11120011101121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 606745.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11120011101121 its reverse (12110111002111), we get a palindrome (23230122103232).
It can be divided in two parts, 1112001 and 1101121, that added together give a palindrome (2213122).
The spelling of 11120011101121 in words is "eleven trillion, one hundred twenty billion, eleven million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •