Base | Representation |
---|---|
bin | 10011101011111111111111 |
3 | 100201012111122 |
4 | 103223333333 |
5 | 2310122314 |
6 | 302341155 |
7 | 61603346 |
oct | 23537777 |
9 | 10635448 |
10 | 5160959 |
11 | 2a05561 |
12 | 188a7bb |
13 | 10b912b |
14 | 984b5d |
15 | 6be28e |
hex | 4ebfff |
5160959 has 2 divisors, whose sum is σ = 5160960. Its totient is φ = 5160958.
The previous prime is 5160941. The next prime is 5160971. The reversal of 5160959 is 9590615.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5160959 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5163959) 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, 2580479 + 2580480.
It is an arithmetic number, because the mean of its divisors is an integer number (2580480).
Almost surely, 25160959 is an apocalyptic number.
5160959 is a deficient number, since it is larger than the sum of its proper divisors (1).
5160959 is an equidigital number, since it uses as much as digits as its factorization.
5160959 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12150, while the sum is 35.
The square root of 5160959 is about 2271.7744166180. The cubic root of 5160959 is about 172.8131565593.
The spelling of 5160959 in words is "five million, one hundred sixty thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •