Search a number
-
+
10131152609 = 59612814991
BaseRepresentation
bin10010110111101110…
…10001111011100001
3222011001112212200102
421123313101323201
5131222033340414
64353145432145
7506026243034
oct113367217341
928131485612
1010131152609
1143298539a6
121b68a9b655
13c55c1a776
146c174301b
153e4667ede
hex25bdd1ee1

10131152609 has 8 divisors (see below), whose sum is σ = 10471770240. Its totient is φ = 9796165200.

The previous prime is 10131152599. The next prime is 10131152623. The reversal of 10131152609 is 90625113101.

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 10131152609 - 24 = 10131152593 is a prime.

It is a Duffinian number.

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

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

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

Almost surely, 210131152609 is an apocalyptic number.

It is an amenable number.

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

10131152609 is an equidigital number, since it uses as much as digits as its factorization.

10131152609 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 2815111.

The product of its (nonzero) digits is 1620, while the sum is 29.

The spelling of 10131152609 in words is "ten billion, one hundred thirty-one million, one hundred fifty-two thousand, six hundred nine".

Divisors: 1 59 61 3599 2814991 166084469 171714451 10131152609