Base | Representation |
---|---|
bin | 10011101100000111001001 |
3 | 100201020010121 |
4 | 103230013021 |
5 | 2310131132 |
6 | 302343241 |
7 | 61604602 |
oct | 23540711 |
9 | 10636117 |
10 | 5161417 |
11 | 2a05938 |
12 | 188ab21 |
13 | 10b93c1 |
14 | 984da9 |
15 | 6be497 |
hex | 4ec1c9 |
5161417 has 2 divisors, whose sum is σ = 5161418. Its totient is φ = 5161416.
The previous prime is 5161411. The next prime is 5161423. The reversal of 5161417 is 7141615.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (5161411) and next prime (5161423).
It can be written as a sum of positive squares in only one way, i.e., 5125696 + 35721 = 2264^2 + 189^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5161417 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5161391 and 5161400.
It is not a weakly prime, because it can be changed into another prime (5161411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2580708 + 2580709.
It is an arithmetic number, because the mean of its divisors is an integer number (2580709).
Almost surely, 25161417 is an apocalyptic number.
It is an amenable number.
5161417 is a deficient number, since it is larger than the sum of its proper divisors (1).
5161417 is an equidigital number, since it uses as much as digits as its factorization.
5161417 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 840, while the sum is 25.
The square root of 5161417 is about 2271.8752166437. The cubic root of 5161417 is about 172.8182684054.
It can be divided in two parts, 5 and 161417, that multiplied together give a triangular number (807085 = T1270).
The spelling of 5161417 in words is "five million, one hundred sixty-one thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •