Base | Representation |
---|---|
bin | 10000011100100000100… |
… | …001101110110001101111 |
3 | 11000001001011010121102122 |
4 | 100130200201232301233 |
5 | 122003442230041421 |
6 | 2223100530543155 |
7 | 144435323312246 |
oct | 20344041566157 |
9 | 4001034117378 |
10 | 1130122112111 |
11 | 3a6311519723 |
12 | 163037737abb |
13 | 82754556755 |
14 | 3c9abc1b95d |
15 | 1e5e519b2ab |
hex | 1072086ec6f |
1130122112111 has 2 divisors, whose sum is σ = 1130122112112. Its totient is φ = 1130122112110.
The previous prime is 1130122112047. The next prime is 1130122112149. The reversal of 1130122112111 is 1112112210311.
It is a strong prime.
It is an emirp because it is prime and its reverse (1112112210311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1130122112111 - 26 = 1130122112047 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1130122112111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1130122112191) 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 as a sum of consecutive naturals, namely, 565061056055 + 565061056056.
It is an arithmetic number, because the mean of its divisors is an integer number (565061056056).
Almost surely, 21130122112111 is an apocalyptic number.
1130122112111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1130122112111 is an equidigital number, since it uses as much as digits as its factorization.
1130122112111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 1130122112111 its reverse (1112112210311), we get a palindrome (2242234322422).
The spelling of 1130122112111 in words is "one trillion, one hundred thirty billion, one hundred twenty-two million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •