Search a number
-
+
30125350035 = 33511231411451
BaseRepresentation
bin11100000011100111…
…000101110010010011
32212202111011100022000
4130003213011302103
5443144042200120
621501150445043
72114351151564
oct340347056223
985674140260
1030125350035
1111859a7a400
125a08b03783
132ac1343211
14165ad5816b
15bb4b39990
hex7039c5c93

30125350035 has 192 divisors, whose sum is σ = 62291496960. Its totient is φ = 13780800000.

The previous prime is 30125350019. The next prime is 30125350037. The reversal of 30125350035 is 53005352103.

30125350035 is a `hidden beast` number, since 3 + 0 + 125 + 3 + 500 + 35 = 666.

It is not a de Polignac number, because 30125350035 - 24 = 30125350019 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (27).

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

It is not an unprimeable number, because it can be changed into a prime (30125350037) 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 191 ways as a sum of consecutive naturals, for example, 20761060 + ... + 20762510.

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

Almost surely, 230125350035 is an apocalyptic number.

30125350035 is an abundant number, since it is smaller than the sum of its proper divisors (32166146925).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

The spelling of 30125350035 in words is "thirty billion, one hundred twenty-five million, three hundred fifty thousand, thirty-five".