Search a number
-
+
16503216070 = 2511150029237
BaseRepresentation
bin11110101111010101…
…10001011111000110
31120121010201020110211
433113222301133012
5232244310403240
611325333110034
71122652010365
oct172752613706
946533636424
1016503216070
116aa96a9550
123246a8831a
1317300c6113
14b27b237dc
15668c96bea
hex3d7ab17c6

16503216070 has 16 divisors (see below), whose sum is σ = 32406315408. Its totient is φ = 6001169440.

The previous prime is 16503216053. The next prime is 16503216077. The reversal of 16503216070 is 7061230561.

It is a super-2 number, since 2×165032160702 (a number of 21 digits) contains 22 as substring.

It is a congruent number.

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

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

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

Almost surely, 216503216070 is an apocalyptic number.

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

16503216070 is a deficient number, since it is larger than the sum of its proper divisors (15903099338).

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

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

The sum of its prime factors is 150029255.

The product of its (nonzero) digits is 7560, while the sum is 31.

The spelling of 16503216070 in words is "sixteen billion, five hundred three million, two hundred sixteen thousand, seventy".

Divisors: 1 2 5 10 11 22 55 110 150029237 300058474 750146185 1500292370 1650321607 3300643214 8251608035 16503216070