Search a number
-
+
5159701 is a prime number
BaseRepresentation
bin10011101011101100010101
3100201010210001
4103223230111
52310102301
6302331301
761566601
oct23535425
910633701
105159701
112a04618
121889b31
1310b86a1
14984501
156bdc01
hex4ebb15

5159701 has 2 divisors, whose sum is σ = 5159702. Its totient is φ = 5159700.

The previous prime is 5159683. The next prime is 5159711. The reversal of 5159701 is 1079515.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4626801 + 532900 = 2151^2 + 730^2 .

It is a cyclic number.

It is not a de Polignac number, because 5159701 - 25 = 5159669 is a prime.

It is a Chen prime.

5159701 is a lucky number.

It is equal to p358822 and since 5159701 and 358822 have the same sum of digits, it is a Honaker prime.

It is a self number, because there is not a number n which added to its sum of digits gives 5159701.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (5159711) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2579850 + 2579851.

It is an arithmetic number, because the mean of its divisors is an integer number (2579851).

Almost surely, 25159701 is an apocalyptic number.

It is an amenable number.

5159701 is a deficient number, since it is larger than the sum of its proper divisors (1).

5159701 is an equidigital number, since it uses as much as digits as its factorization.

5159701 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 1575, while the sum is 28.

The square root of 5159701 is about 2271.4975236614. The cubic root of 5159701 is about 172.7991141680.

The spelling of 5159701 in words is "five million, one hundred fifty-nine thousand, seven hundred one".