Base | Representation |
---|---|
bin | 100101010000101101100… |
… | …1100110110001011000111 |
3 | 200010120112102200010122202 |
4 | 1022201123030312023013 |
5 | 1132401034031023421 |
6 | 14520340512345115 |
7 | 1035663255134441 |
oct | 112413314661307 |
9 | 20116472603582 |
10 | 5121131111111 |
11 | 16a4950006154 |
12 | 6a861454519b |
13 | 2b1bc7702c42 |
14 | 139c15009491 |
15 | 8d32bb5610b |
hex | 4a85b3362c7 |
5121131111111 has 2 divisors, whose sum is σ = 5121131111112. Its totient is φ = 5121131111110.
The previous prime is 5121131111077. The next prime is 5121131111141. The reversal of 5121131111111 is 1111111311215.
It is a m-pointer prime, because the next prime (5121131111141) can be obtained adding 5121131111111 to its product of digits (30).
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5121131111111 is a prime.
It is a Sophie Germain prime.
5121131111111 is a modest number, since divided by 1111111 gives 512113 as remainder.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5121131111141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2560565555555 + 2560565555556.
It is an arithmetic number, because the mean of its divisors is an integer number (2560565555556).
Almost surely, 25121131111111 is an apocalyptic number.
5121131111111 is a deficient number, since it is larger than the sum of its proper divisors (1).
5121131111111 is an equidigital number, since it uses as much as digits as its factorization.
5121131111111 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 30, while the sum is 20.
Adding to 5121131111111 its reverse (1111111311215), we get a palindrome (6232242422326).
The spelling of 5121131111111 in words is "five trillion, one hundred twenty-one billion, one hundred thirty-one million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •