Search a number
-
+
10151991 = 325321283
BaseRepresentation
bin100110101110…
…100000110111
3201002202220200
4212232200313
510044330431
61001331543
7152201433
oct46564067
921082820
1010151991
115804383
123496bb3
132145ac5
1414c39c3
15d57ee6
hex9ae837

10151991 has 12 divisors (see below), whose sum is σ = 14941368. Its totient is φ = 6639984.

The previous prime is 10151987. The next prime is 10152011. The reversal of 10151991 is 19915101.

It is not a de Polignac number, because 10151991 - 22 = 10151987 is a prime.

It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10165 + ... + 11118.

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

Almost surely, 210151991 is an apocalyptic number.

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

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

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

The sum of its prime factors is 21342 (or 21339 counting only the distinct ones).

The product of its (nonzero) digits is 405, while the sum is 27.

The square root of 10151991 is about 3186.2189190324. The cubic root of 10151991 is about 216.5295008220.

The spelling of 10151991 in words is "ten million, one hundred fifty-one thousand, nine hundred ninety-one".

Divisors: 1 3 9 53 159 477 21283 63849 191547 1127999 3383997 10151991