Search a number
-
+
16749814065 = 351116654271
BaseRepresentation
bin11111001100101110…
…11110000100110001
31121020022201201022220
433212113132010301
5233300423022230
611410022351253
71132035033105
oct174627360461
947208651286
1016749814065
117115919246
1232b558b529
13176c2171aa
14b4c795905
15680757d10
hex3e65de131

16749814065 has 8 divisors (see below), whose sum is σ = 26799702528. Its totient is φ = 8933234160.

The previous prime is 16749814063. The next prime is 16749814099. The reversal of 16749814065 is 56041894761.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 16749814065 - 21 = 16749814063 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 16749813999 and 16749814017.

It is not an unprimeable number, because it can be changed into a prime (16749814063) 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 7 ways as a sum of consecutive naturals, for example, 558327121 + ... + 558327150.

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

Almost surely, 216749814065 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 1116654279.

The product of its (nonzero) digits is 1451520, while the sum is 51.

The spelling of 16749814065 in words is "sixteen billion, seven hundred forty-nine million, eight hundred fourteen thousand, sixty-five".

Divisors: 1 3 5 15 1116654271 3349962813 5583271355 16749814065