Base | Representation |
---|---|
bin | 1010000111010001010001… |
… | …0111010111111101100001 |
3 | 1110101001200202102000020211 |
4 | 2201310110113113331201 |
5 | 2424142241033013441 |
6 | 35352244001134121 |
7 | 2225252156311402 |
oct | 241642427277541 |
9 | 43331622360224 |
10 | 11120012001121 |
11 | 35a7a74970711 |
12 | 12b717162a341 |
13 | 6287c6c50a7a |
14 | 2a62d63239a9 |
15 | 1443cc730a81 |
hex | a1d145d7f61 |
11120012001121 has 8 divisors (see below), whose sum is σ = 11200507774400. Its totient is φ = 11039523309360.
The previous prime is 11120012001113. The next prime is 11120012001151. The reversal of 11120012001121 is 12110021002111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11120012001121 - 23 = 11120012001113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11120012001101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1402060 + ... + 4919938.
It is an arithmetic number, because the mean of its divisors is an integer number (1400063471800).
Almost surely, 211120012001121 is an apocalyptic number.
It is an amenable number.
11120012001121 is a deficient number, since it is larger than the sum of its proper divisors (80495773279).
11120012001121 is a wasteful number, since it uses less digits than its factorization.
11120012001121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3540759.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11120012001121 its reverse (12110021002111), we get a palindrome (23230033003232).
The spelling of 11120012001121 in words is "eleven trillion, one hundred twenty billion, twelve million, one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •