Search a number
-
+
10150923 = 314922709
BaseRepresentation
bin100110101110…
…010000001011
3201002201110010
4212232100023
510044312143
61001323003
7152165346
oct46562013
921081403
1010150923
1158035a2
123496463
132145483
1414c345d
15d57a33
hex9ae40b

10150923 has 8 divisors (see below), whose sum is σ = 13626000. Its totient is φ = 6721568.

The previous prime is 10150901. The next prime is 10150937. The reversal of 10150923 is 32905101.

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 10150923 - 210 = 10149899 is a prime.

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

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

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

Almost surely, 210150923 is an apocalyptic number.

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

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

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

The sum of its prime factors is 22861.

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

The square root of 10150923 is about 3186.0513178541. The cubic root of 10150923 is about 216.5219075129.

The spelling of 10150923 in words is "ten million, one hundred fifty thousand, nine hundred twenty-three".

Divisors: 1 3 149 447 22709 68127 3383641 10150923