Base | Representation |
---|---|
bin | 1010000111011000101011… |
… | …1011010001001101001001 |
3 | 1110101020211101021211021222 |
4 | 2201312022323101031021 |
5 | 2424210324241401441 |
6 | 35353213215011425 |
7 | 2225352361463111 |
oct | 241661273211511 |
9 | 43336741254258 |
10 | 11122001122121 |
11 | 35a88a575776a |
12 | 12b7627809b75 |
13 | 628a53089446 |
14 | 2a644458a041 |
15 | 144497194d4b |
hex | a1d8aed1349 |
11122001122121 has 2 divisors, whose sum is σ = 11122001122122. Its totient is φ = 11122001122120.
The previous prime is 11122001122103. The next prime is 11122001122129. The reversal of 11122001122121 is 12122110022111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6250000000000 + 4872001122121 = 2500000^2 + 2207261^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11122001122121 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11122001122121.
It is not a weakly prime, because it can be changed into another prime (11122001122129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5561000561060 + 5561000561061.
It is an arithmetic number, because the mean of its divisors is an integer number (5561000561061).
Almost surely, 211122001122121 is an apocalyptic number.
It is an amenable number.
11122001122121 is a deficient number, since it is larger than the sum of its proper divisors (1).
11122001122121 is an equidigital number, since it uses as much as digits as its factorization.
11122001122121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11122001122121 its reverse (12122110022111), we get a palindrome (23244111144232).
The spelling of 11122001122121 in words is "eleven trillion, one hundred twenty-two billion, one million, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •