Search a number
-
+
10115151 = 34182237
BaseRepresentation
bin100110100101…
…100001001111
3201000220101020
4212211201033
510042141101
61000445223
7151656144
oct46454117
921026336
1010115151
115789732
123479813
1321320c7
1414b43cb
15d4c136
hex9a584f

10115151 has 8 divisors (see below), whose sum is σ = 13815984. Its totient is φ = 6578880.

The previous prime is 10115143. The next prime is 10115173. The reversal of 10115151 is 15151101.

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

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

It is not a de Polignac number, because 10115151 - 23 = 10115143 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10115351) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 40996 + ... + 41241.

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

Almost surely, 210115151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 82281.

The product of its (nonzero) digits is 25, while the sum is 15.

The square root of 10115151 is about 3180.4325177560. The cubic root of 10115151 is about 216.2672660432.

Adding to 10115151 its reverse (15151101), we get a palindrome (25266252).

The spelling of 10115151 in words is "ten million, one hundred fifteen thousand, one hundred fifty-one".

Divisors: 1 3 41 123 82237 246711 3371717 10115151