Search a number
-
+
30721255851 = 3111325508563
BaseRepresentation
bin11100100111001000…
…010010100110101011
32221022000110111101210
4130213020102212223
51000404120141401
622040235044203
72135205236406
oct344710224653
987260414353
1030721255851
1112035391250
125b545a0663
132b87937400
1416b6156d3d
15bec0e94d6
hex7272129ab

30721255851 has 24 divisors (see below), whose sum is σ = 48387226176. Its totient is φ = 17186713440.

The previous prime is 30721255837. The next prime is 30721255853. The reversal of 30721255851 is 15855212703.

It is not a de Polignac number, because 30721255851 - 215 = 30721223083 is a prime.

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

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

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

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

Almost surely, 230721255851 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 84000, while the sum is 39.

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

Divisors: 1 3 11 13 33 39 143 169 429 507 1859 5577 5508563 16525689 60594193 71611319 181782579 214833957 787724509 930947147 2363173527 2792841441 10240418617 30721255851