Search a number
-
+
30995002752 = 2737171374951
BaseRepresentation
bin11100110111011100…
…100011010110000000
32222000002120021112220
4130313130203112000
51001434210042002
622123334251040
72145041114340
oct346734432600
988002507486
1030995002752
111216596435a
1260101b6a80
132bcc57281c
141700654d20
15c1616e7bc
hex737723580

30995002752 has 256 divisors, whose sum is σ = 100374266880. Its totient is φ = 8272281600.

The previous prime is 30995002681. The next prime is 30995002777. The reversal of 30995002752 is 25720059903.

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

It is a congruent number.

It is an unprimeable number.

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 31 ways as a sum of consecutive naturals, for example, 6257877 + ... + 6262827.

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

Almost surely, 230995002752 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 30995002752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (50187133440).

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

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

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

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

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

The product of its (nonzero) digits is 170100, while the sum is 42.

The spelling of 30995002752 in words is "thirty billion, nine hundred ninety-five million, two thousand, seven hundred fifty-two".