[go: up one dir, main page]

Search a number
-
+
5166257 is a prime number
BaseRepresentation
bin10011101101010010110001
3100201110202212
4103231102301
52310310012
6302421505
761624655
oct23552261
910643685
105166257
112a09538
121891895
1310bb675
14986a65
156c0b22
hex4ed4b1

5166257 has 2 divisors, whose sum is σ = 5166258. Its totient is φ = 5166256.

The previous prime is 5166253. The next prime is 5166289. The reversal of 5166257 is 7526615.

It is a happy number.

5166257 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is an a-pointer prime, because the next prime (5166289) can be obtained adding 5166257 to its sum of digits (32).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 4532641 + 633616 = 2129^2 + 796^2 .

It is a cyclic number.

It is not a de Polignac number, because 5166257 - 22 = 5166253 is a prime.

It is a super-2 number, since 2×51662572 = 53380422780098, which contains 22 as substring.

It is equal to p359249 and since 5166257 and 359249 have the same sum of digits, it is a Honaker prime.

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

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

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

Almost surely, 25166257 is an apocalyptic number.

It is an amenable number.

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

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

5166257 is an evil number, because the sum of its binary digits is even.

The product of its digits is 12600, while the sum is 32.

The square root of 5166257 is about 2272.9401663924. The cubic root of 5166257 is about 172.8722703138.

The spelling of 5166257 in words is "five million, one hundred sixty-six thousand, two hundred fifty-seven".