Search a number
-
+
16020116670 = 235534003889
BaseRepresentation
bin11101110101101111…
…11001010010111110
31112100110200020200110
432322313321102332
5230302122213140
611205354410450
71104664513335
oct167267712276
945313606613
1016020116670
116880a35848
123131130a26
131683caa79c
14abd8cad1c
1563b66b380
hex3badf94be

16020116670 has 16 divisors (see below), whose sum is σ = 38448280080. Its totient is φ = 4272031104.

The previous prime is 16020116657. The next prime is 16020116689. The reversal of 16020116670 is 7661102061.

It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 534003889 = 16020116670 / (1 + 6 + 0 + 2 + 0 + 1 + 1 + 6 + 6 + 7 + 0).

It is a Curzon number.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 267001915 + ... + 267001974.

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

Almost surely, 216020116670 is an apocalyptic number.

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

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

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

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

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

The sum of its prime factors is 534003899.

The product of its (nonzero) digits is 3024, while the sum is 30.

The spelling of 16020116670 in words is "sixteen billion, twenty million, one hundred sixteen thousand, six hundred seventy".

Divisors: 1 2 3 5 6 10 15 30 534003889 1068007778 1602011667 2670019445 3204023334 5340038890 8010058335 16020116670