Search a number
-
+
10151931 = 327112487
BaseRepresentation
bin100110101110…
…011111111011
3201002202211110
4212232133323
510044330211
61001331403
7152201316
oct46563773
921082743
1010151931
115804329
123496b63
132145a7a
1414c397d
15d57ea6
hex9ae7fb

10151931 has 8 divisors (see below), whose sum is σ = 13586944. Its totient is φ = 6742440.

The previous prime is 10151929. The next prime is 10151957. The reversal of 10151931 is 13915101.

10151931 is digitally balanced in base 3, 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 10151931 - 21 = 10151929 is a prime.

It is a super-2 number, since 2×101519312 = 206123406057522, which contains 22 as substring.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 10151898 and 10151907.

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 (17) of ones.

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

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

Almost surely, 210151931 is an apocalyptic number.

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

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

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

The sum of its prime factors is 12761.

The product of its (nonzero) digits is 135, while the sum is 21.

The square root of 10151931 is about 3186.2095034696. The cubic root of 10151931 is about 216.5290742457.

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

Divisors: 1 3 271 813 12487 37461 3383977 10151931