Search a number
-
+
30835940352 = 2103729197251
BaseRepresentation
bin11100101101111101…
…110001110000000000
32221121000021001221220
4130231331301300000
51001123000042402
622055453115040
72141100111510
oct345575616000
987530231856
1030835940352
11120940a2428
125b86a88a80
132ba561ca69
1416c748b840
15c071eedbc
hex72df71c00

30835940352 has 352 divisors, whose sum is σ = 98051627520. Its totient is φ = 8429568000.

The previous prime is 30835940327. The next prime is 30835940411. The reversal of 30835940352 is 25304953803.

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, 122852227 + ... + 122852477.

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

Almost surely, 230835940352 is an apocalyptic number.

30835940352 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 30835940352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (49025813760).

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

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

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

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

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

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

The spelling of 30835940352 in words is "thirty billion, eight hundred thirty-five million, nine hundred forty thousand, three hundred fifty-two".