Search a number
-
+
10115147 = 72362827
BaseRepresentation
bin100110100101…
…100001001011
3201000220101002
4212211201023
510042141042
61000445215
7151656140
oct46454113
921026332
1010115147
115789729
12347980b
1321320c3
1414b43c7
15d4c132
hex9a584b

10115147 has 8 divisors (see below), whose sum is σ = 12062976. Its totient is φ = 8293032.

The previous prime is 10115143. The next prime is 10115173. The reversal of 10115147 is 74151101.

It is a happy number.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 10115147 - 22 = 10115143 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (10115143) 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 in 7 ways as a sum of consecutive naturals, for example, 31253 + ... + 31574.

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

Almost surely, 210115147 is an apocalyptic number.

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

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

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

The sum of its prime factors is 62857.

The product of its (nonzero) digits is 140, while the sum is 20.

The square root of 10115147 is about 3180.4318889107. The cubic root of 10115147 is about 216.2672375358.

Adding to 10115147 its reverse (74151101), we get a palindrome (84266248).

The spelling of 10115147 in words is "ten million, one hundred fifteen thousand, one hundred forty-seven".

Divisors: 1 7 23 161 62827 439789 1445021 10115147