Base | Representation |
---|---|
bin | 1010000111010100111101… |
… | …1000010110000010010001 |
3 | 1110101011020202110210211120 |
4 | 2201311033120112002101 |
5 | 2424201303020023441 |
6 | 35352530130432453 |
7 | 2225315541151440 |
oct | 241651730260221 |
9 | 43334222423746 |
10 | 11121002111121 |
11 | 35a8432849a41 |
12 | 12b73a9132729 |
13 | 628924107486 |
14 | 2a638ba18d57 |
15 | 14443960b966 |
hex | a1d4f616091 |
11121002111121 has 32 divisors (see below), whose sum is σ = 17185491376128. Its totient is φ = 6265162874880.
The previous prime is 11121002111101. The next prime is 11121002111143. The reversal of 11121002111121 is 12111120012111.
It is not a de Polignac number, because 11121002111121 - 26 = 11121002111057 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11121002111121.
It is not an unprimeable number, because it can be changed into a prime (11121002111101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 59452686 + ... + 59639448.
It is an arithmetic number, because the mean of its divisors is an integer number (537046605504).
Almost surely, 211121002111121 is an apocalyptic number.
It is an amenable number.
11121002111121 is a deficient number, since it is larger than the sum of its proper divisors (6064489265007).
11121002111121 is a wasteful number, since it uses less digits than its factorization.
11121002111121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226781.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 11121002111121 its reverse (12111120012111), we get a palindrome (23232122123232).
The spelling of 11121002111121 in words is "eleven trillion, one hundred twenty-one billion, two million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •