Search a number
-
+
16003059072 = 27371113173179
BaseRepresentation
bin11101110011101101…
…10100110110000000
31112022021120122001120
432321312310312000
5230233240342242
611203545032240
71104366520620
oct167166646600
945267518046
1016003059072
116872345160
123127485680
1316805b7730
14abb52a880
15639dec1ec
hex3b9db4d80

16003059072 has 1024 divisors, whose sum is σ = 63170150400. Its totient is φ = 3450470400.

The previous prime is 16003059049. The next prime is 16003059077. The reversal of 16003059072 is 27095030061.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (16003059077) by changing a digit.

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 202570329 + ... + 202570407.

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

Almost surely, 216003059072 is an apocalyptic number.

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

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

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

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

16003059072 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 11340, while the sum is 33.

The spelling of 16003059072 in words is "sixteen billion, three million, fifty-nine thousand, seventy-two".