Search a number
-
+
30632487249 = 3731321973127
BaseRepresentation
bin11100100001110101…
…101010100101010001
32221001211102120202210
4130201311222211101
51000213404042444
622023344302333
72133046563000
oct344165524521
987054376683
1030632487249
1111a9a271071
125b2a9119a9
132b72426b00
1416a844ac37
15be44127b9
hex721d6a951

30632487249 has 192 divisors, whose sum is σ = 55468032000. Its totient is φ = 14978815488.

The previous prime is 30632487239. The next prime is 30632487251. The reversal of 30632487249 is 94278423603.

It is not a de Polignac number, because 30632487249 - 28 = 30632486993 is a prime.

It is a Curzon number.

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

It is not an unprimeable number, because it can be changed into a prime (30632487229) 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, 241200624 + ... + 241200750.

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

Almost surely, 230632487249 is an apocalyptic number.

30632487249 is a gapful number since it is divisible by the number (39) formed by its first and last digit.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 1741824, while the sum is 48.

The spelling of 30632487249 in words is "thirty billion, six hundred thirty-two million, four hundred eighty-seven thousand, two hundred forty-nine".