Base | Representation |
---|---|
bin | 100101001011100011010… |
… | …1110001010101011111111 |
3 | 200002111221011210202110011 |
4 | 1022113012232022223333 |
5 | 1132210340311343421 |
6 | 14511305152124051 |
7 | 1035121543141426 |
oct | 112270656125377 |
9 | 20074834722404 |
10 | 5110050106111 |
11 | 16a0184080085 |
12 | 6a6441536627 |
13 | 2b0b4ca85952 |
14 | 1394834902bd |
15 | 8cdcde154e1 |
hex | 4a5c6b8aaff |
5110050106111 has 2 divisors, whose sum is σ = 5110050106112. Its totient is φ = 5110050106110.
The previous prime is 5110050106097. The next prime is 5110050106127. The reversal of 5110050106111 is 1116010500115.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5110050106111 - 27 = 5110050105983 is a prime.
It is a super-2 number, since 2×51100501061112 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5110050106141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2555025053055 + 2555025053056.
It is an arithmetic number, because the mean of its divisors is an integer number (2555025053056).
Almost surely, 25110050106111 is an apocalyptic number.
5110050106111 is a deficient number, since it is larger than the sum of its proper divisors (1).
5110050106111 is an equidigital number, since it uses as much as digits as its factorization.
5110050106111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 150, while the sum is 22.
Adding to 5110050106111 its reverse (1116010500115), we get a palindrome (6226060606226).
The spelling of 5110050106111 in words is "five trillion, one hundred ten billion, fifty million, one hundred six thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •