Base | Representation |
---|---|
bin | 10001100111111100011… |
… | …100011001000001011011 |
3 | 11021210010010001002110022 |
4 | 101213330130121001123 |
5 | 124320334001024011 |
6 | 2324214212341055 |
7 | 153333465405401 |
oct | 21477434310133 |
9 | 4253103032408 |
10 | 1211121111131 |
11 | 4276a7325528 |
12 | 17688201478b |
13 | 8a292637c39 |
14 | 42893523471 |
15 | 217861ee8db |
hex | 119fc71905b |
1211121111131 has 2 divisors, whose sum is σ = 1211121111132. Its totient is φ = 1211121111130.
The previous prime is 1211121111127. The next prime is 1211121111143. The reversal of 1211121111131 is 1311111211121.
It is a m-pointer prime, because the next prime (1211121111143) can be obtained adding 1211121111131 to its product of digits (12).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1211121111131 - 22 = 1211121111127 is a prime.
It is a super-2 number, since 2×12111211111312 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1211121111121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605560555565 + 605560555566.
It is an arithmetic number, because the mean of its divisors is an integer number (605560555566).
Almost surely, 21211121111131 is an apocalyptic number.
1211121111131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1211121111131 is an equidigital number, since it uses as much as digits as its factorization.
1211121111131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 12, while the sum is 17.
Adding to 1211121111131 its reverse (1311111211121), we get a palindrome (2522232322252).
The spelling of 1211121111131 in words is "one trillion, two hundred eleven billion, one hundred twenty-one million, one hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •