Search a number
-
+
10117151 = 111516091
BaseRepresentation
bin100110100110…
…000000011111
3201001000010022
4212212000133
510042222101
61000502355
7151665032
oct46460037
921030108
1010117151
115790190
12347a9bb
132132ca5
1414b5019
15d4ca1b
hex9a601f

10117151 has 8 divisors (see below), whose sum is σ = 11111808. Its totient is φ = 9135000.

The previous prime is 10117147. The next prime is 10117157. The reversal of 10117151 is 15171101.

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 10117151 - 22 = 10117147 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10117157) 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, 1385 + ... + 4706.

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

Almost surely, 210117151 is an apocalyptic number.

10117151 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

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

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

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

The sum of its prime factors is 6253.

The product of its (nonzero) digits is 35, while the sum is 17.

The square root of 10117151 is about 3180.7469248590. The cubic root of 10117151 is about 216.2815187890.

Adding to 10117151 its reverse (15171101), we get a palindrome (25288252).

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

Divisors: 1 11 151 1661 6091 67001 919741 10117151