Base | Representation |
---|---|
bin | 1001101001001010… |
… | …10101110011100011 |
3 | 111100210202112201102 |
4 | 10310211111303203 |
5 | 41100323434141 |
6 | 2213420425015 |
7 | 242203141334 |
oct | 46445256343 |
9 | 14323675642 |
10 | 5177171171 |
11 | 2217418367 |
12 | 10059a816b |
13 | 646781cc3 |
14 | 37182028b |
15 | 2047a199b |
hex | 134955ce3 |
5177171171 has 2 divisors, whose sum is σ = 5177171172. Its totient is φ = 5177171170.
The previous prime is 5177171161. The next prime is 5177171173. The reversal of 5177171171 is 1711717715.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5177171171 - 26 = 5177171107 is a prime.
It is a super-2 number, since 2×51771711712 = 53606202667667022482, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 5177171173, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (5177171173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2588585585 + 2588585586.
It is an arithmetic number, because the mean of its divisors is an integer number (2588585586).
Almost surely, 25177171171 is an apocalyptic number.
5177171171 is a deficient number, since it is larger than the sum of its proper divisors (1).
5177171171 is an equidigital number, since it uses as much as digits as its factorization.
5177171171 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 12005, while the sum is 38.
The square root of 5177171171 is about 71952.5619488285. The cubic root of 5177171171 is about 1729.9392063237.
Adding to 5177171171 its reverse (1711717715), we get a palindrome (6888888886).
The spelling of 5177171171 in words is "five billion, one hundred seventy-seven million, one hundred seventy-one thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •