Search a number
-
+
10115251 = 101100151
BaseRepresentation
bin100110100101…
…100010110011
3201000220111221
4212211202303
510042142001
61000445511
7151656346
oct46454263
921026457
1010115251
115789813
123479897
132132173
1414b445d
15d4c1a1
hex9a58b3

10115251 has 4 divisors (see below), whose sum is σ = 10215504. Its totient is φ = 10015000.

The previous prime is 10115249. The next prime is 10115267. The reversal of 10115251 is 15251101.

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

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 10115251 - 21 = 10115249 is a prime.

It is a Duffinian 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 3 ways as a sum of consecutive naturals, for example, 49975 + ... + 50176.

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

Almost surely, 210115251 is an apocalyptic number.

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

10115251 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 100252.

The product of its (nonzero) digits is 50, while the sum is 16.

The square root of 10115251 is about 3180.4482388494. The cubic root of 10115251 is about 216.2679787251.

Adding to 10115251 its reverse (15251101), we get a palindrome (25366352).

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

Divisors: 1 101 100151 10115251