Search a number
-
+
16601656013 = 232935277057
BaseRepresentation
bin11110111011000100…
…10010101011001101
31120211222221111200122
433131202102223031
5233000010443023
611343211034325
71125255514325
oct173542225315
946758844618
1016601656013
11704a224978
123273a3b9a5
1317476117c7
14b36c2a285
1567273e2c8
hex3dd892acd

16601656013 has 16 divisors (see below), whose sum is σ = 17928449280. Its totient is φ = 15325744896.

The previous prime is 16601655997. The next prime is 16601656061. The reversal of 16601656013 is 31065610661.

It is a cyclic number.

It is not a de Polignac number, because 16601656013 - 24 = 16601655997 is a prime.

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

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2348981 + ... + 2356037.

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

Almost surely, 216601656013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 10636.

The product of its (nonzero) digits is 19440, while the sum is 35.

The spelling of 16601656013 in words is "sixteen billion, six hundred one million, six hundred fifty-six thousand, thirteen".

Divisors: 1 23 29 667 3527 7057 81121 102283 162311 204653 2352509 4707019 24890039 572470897 721811131 16601656013