Search a number
-
+
16789957632 = 2103272331117
BaseRepresentation
bin11111010001100001…
…00110110000000000
31121100010021012221200
433220300212300000
5233341212121012
611414015021200
71133033166540
oct175060466000
947303235850
1016789957632
117136547748
123306b0a800
131777631196
14b53c45320
156840373dc
hex3e8c26c00

16789957632 has 264 divisors, whose sum is σ = 55694055456. Its totient is φ = 4772265984.

The previous prime is 16789957621. The next prime is 16789957651. The reversal of 16789957632 is 23675998761.

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

It is a self number, because there is not a number n which added to its sum of digits gives 16789957632.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15030738 + ... + 15031854.

Almost surely, 216789957632 is an apocalyptic number.

16789957632 is a gapful number since it is divisible by the number (12) 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 16789957632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27847027728).

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

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

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

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

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

The product of its digits is 34292160, while the sum is 63.

The spelling of 16789957632 in words is "sixteen billion, seven hundred eighty-nine million, nine hundred fifty-seven thousand, six hundred thirty-two".