Search a number
-
+
10115173 is a prime number
BaseRepresentation
bin100110100101…
…100001100101
3201000220102001
4212211201211
510042141143
61000445301
7151656205
oct46454145
921026361
1010115173
115789752
123479831
132132113
1414b4405
15d4c14d
hex9a5865

10115173 has 2 divisors, whose sum is σ = 10115174. Its totient is φ = 10115172.

The previous prime is 10115143. The next prime is 10115177. The reversal of 10115173 is 37151101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 6666724 + 3448449 = 2582^2 + 1857^2 .

It is a cyclic number.

It is not a de Polignac number, because 10115173 - 213 = 10106981 is a prime.

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

It is a congruent number.

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

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

Almost surely, 210115173 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 105, while the sum is 19.

The square root of 10115173 is about 3180.4359764032. The cubic root of 10115173 is about 216.2674228336.

Adding to 10115173 its reverse (37151101), we get a palindrome (47266274).

The spelling of 10115173 in words is "ten million, one hundred fifteen thousand, one hundred seventy-three".