Search a number
-
+
16489279071 = 3223757105229
BaseRepresentation
bin11110101101101011…
…00110111001011111
31120120011111011111200
433112311212321133
5232232223412241
611324114250543
71122422362626
oct172665467137
946504434450
1016489279071
116aa184a471
123242286a53
13172a256585
14b25d366bd
156679424b6
hex3d6d66e5f

16489279071 has 24 divisors (see below), whose sum is σ = 24886474080. Its totient is φ = 10500912576.

The previous prime is 16489279063. The next prime is 16489279097. The reversal of 16489279071 is 17097298461.

16489279071 is a `hidden beast` number, since 1 + 6 + 489 + 2 + 7 + 90 + 71 = 666.

It is not a de Polignac number, because 16489279071 - 23 = 16489279063 is a prime.

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

It is a congruent number.

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

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 23 ways as a sum of consecutive naturals, for example, 104085 + ... + 209313.

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

Almost surely, 216489279071 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 1524096, while the sum is 54.

The spelling of 16489279071 in words is "sixteen billion, four hundred eighty-nine million, two hundred seventy-nine thousand, seventy-one".

Divisors: 1 3 9 23 69 207 757 2271 6813 17411 52233 105229 156699 315687 947061 2420267 7260801 21782403 79658353 238975059 716925177 1832142119 5496426357 16489279071