Base | Representation |
---|---|
bin | 100101001100000010111… |
… | …1011010010100111001011 |
3 | 200002121200002010220120012 |
4 | 1022120011323102213023 |
5 | 1132220023242323201 |
6 | 14512002312222135 |
7 | 1035160040344136 |
oct | 112300573224713 |
9 | 20077602126505 |
10 | 5111110511051 |
11 | 16a0678700aa6 |
12 | 6a669869a94b |
13 | 2b0c8b6821ac |
14 | 13954424321d |
15 | 8ce420795bb |
hex | 4a605ed29cb |
5111110511051 has 2 divisors, whose sum is σ = 5111110511052. Its totient is φ = 5111110511050.
The previous prime is 5111110511047. The next prime is 5111110511071. The reversal of 5111110511051 is 1501150111115.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5111110511051 - 22 = 5111110511047 is a prime.
It is a super-2 number, since 2×51111105110512 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (5111110511071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2555555255525 + 2555555255526.
It is an arithmetic number, because the mean of its divisors is an integer number (2555555255526).
Almost surely, 25111110511051 is an apocalyptic number.
5111110511051 is a deficient number, since it is larger than the sum of its proper divisors (1).
5111110511051 is an equidigital number, since it uses as much as digits as its factorization.
5111110511051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 125, while the sum is 23.
Adding to 5111110511051 its reverse (1501150111115), we get a palindrome (6612260622166).
The spelling of 5111110511051 in words is "five trillion, one hundred eleven billion, one hundred ten million, five hundred eleven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •