Search a number
-
+
10130253129 = 323136309151
BaseRepresentation
bin10010110111100111…
…10110010101001001
3222010222212011211100
421123303312111021
5131221321100004
64353114252013
7506015505453
oct113363662511
928128764740
1010130253129
11432929a127
121b68727009
13c55994229
146c158b2d3
153e453b739
hex25bcf6549

10130253129 has 12 divisors (see below), whose sum is σ = 15104607232. Its totient is φ = 6535647000.

The previous prime is 10130253127. The next prime is 10130253149. The reversal of 10130253129 is 92135203101.

10130253129 is a `hidden beast` number, since 101 + 3 + 0 + 2 + 531 + 29 = 666.

It is not a de Polignac number, because 10130253129 - 21 = 10130253127 is a prime.

It is a super-2 number, since 2×101302531292 (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

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

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

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

Almost surely, 210130253129 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

Divisors: 1 3 9 31 93 279 36309151 108927453 326782359 1125583681 3376751043 10130253129