Search a number
-
+
16927209961 = 173132119943
BaseRepresentation
bin11111100001111000…
…01011100111101001
31121200200112100202021
433300330023213221
5234131331204321
611435400504441
71136320624234
oct176074134751
947620470667
1016927209961
1171a6a72422
123344a7b121
131799bb898c
14b6817241b
156910e9941
hex3f0f0b9e9

16927209961 has 8 divisors (see below), whose sum is σ = 18501087744. Its totient is φ = 15417572160.

The previous prime is 16927209889. The next prime is 16927209977. The reversal of 16927209961 is 16990272961.

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

It is a cyclic number.

It is not a de Polignac number, because 16927209961 - 29 = 16927209449 is a prime.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (16927207961) 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, 16059445 + ... + 16060498.

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

Almost surely, 216927209961 is an apocalyptic number.

It is an amenable number.

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

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

16927209961 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 32119991.

The product of its (nonzero) digits is 734832, while the sum is 52.

The spelling of 16927209961 in words is "sixteen billion, nine hundred twenty-seven million, two hundred nine thousand, nine hundred sixty-one".

Divisors: 1 17 31 527 32119943 546039031 995718233 16927209961