Search a number
-
+
10170557 is a prime number
BaseRepresentation
bin100110110011…
…000010111101
3201010201101022
4212303002331
510100424212
61001553525
7152306525
oct46630275
921121338
1010170557
115817321
1234a58a5
1321513a7
1414ca685
15d5d772
hex9b30bd

10170557 has 2 divisors, whose sum is σ = 10170558. Its totient is φ = 10170556.

The previous prime is 10170551. The next prime is 10170581. The reversal of 10170557 is 75507101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10106041 + 64516 = 3179^2 + 254^2 .

It is a cyclic number.

It is not a de Polignac number, because 10170557 - 26 = 10170493 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (10170551) 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, 5085278 + 5085279.

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

Almost surely, 210170557 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1225, while the sum is 26.

The square root of 10170557 is about 3189.1310728786. The cubic root of 10170557 is about 216.6614170983.

Adding to 10170557 its reverse (75507101), we get a palindrome (85677658).

The spelling of 10170557 in words is "ten million, one hundred seventy thousand, five hundred fifty-seven".