Search a number
-
+
30126752601 = 311912931897
BaseRepresentation
bin11100000011101100…
…011100001101011001
32212202120210121020220
4130003230130031121
5443144422040401
621501240510253
72114366112651
oct340354341531
985676717226
1030126752601
111185a848150
125a0947b389
132ac171473a
14165b201361
15bb4d15336
hex703b1c359

30126752601 has 8 divisors (see below), whose sum is σ = 43820731104. Its totient is φ = 18258637920.

The previous prime is 30126752569. The next prime is 30126752611. The reversal of 30126752601 is 10625762103.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 30126752601 - 25 = 30126752569 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 912931897 = 30126752601 / (3 + 0 + 1 + 2 + 6 + 7 + 5 + 2 + 6 + 0 + 1).

It is a Curzon number.

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

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

Almost surely, 230126752601 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 912931911.

The product of its (nonzero) digits is 15120, while the sum is 33.

The spelling of 30126752601 in words is "thirty billion, one hundred twenty-six million, seven hundred fifty-two thousand, six hundred one".

Divisors: 1 3 11 33 912931897 2738795691 10042250867 30126752601