Search a number
-
+
10150317507 = 311319922109
BaseRepresentation
bin10010111010000000…
…11000110111000011
3222012101121112222110
421131000120313003
5131241440130012
64355112310403
7506351163261
oct113500306703
928171545873
1010150317507
114339653860
121b733a2403
13c59b9aa45
146c40d1431
153e61a173c
hex25d018dc3

10150317507 has 16 divisors (see below), whose sum is σ = 15240360960. Its totient is φ = 5953264800.

The previous prime is 10150317497. The next prime is 10150317509. The reversal of 10150317507 is 70571305101.

It is not a de Polignac number, because 10150317507 - 27 = 10150317379 is a prime.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4960032 + ... + 4962077.

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

Almost surely, 210150317507 is an apocalyptic number.

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

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

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

The sum of its prime factors is 9922154.

The product of its (nonzero) digits is 3675, while the sum is 30.

The spelling of 10150317507 in words is "ten billion, one hundred fifty million, three hundred seventeen thousand, five hundred seven".

Divisors: 1 3 11 31 33 93 341 1023 9922109 29766327 109143199 307585379 327429597 922756137 3383439169 10150317507