Search a number
-
+
17131609905 = 351142107327
BaseRepresentation
bin11111111010001111…
…11001111100110001
31122012221010221202120
433331013321330301
5240041143004110
611511541504453
71144352165364
oct177507717461
948187127676
1017131609905
1172a13900a3
1233a1412129
1318003538a7
14b8737c0db
156a4022870
hex3fd1f9f31

17131609905 has 8 divisors (see below), whose sum is σ = 27410575872. Its totient is φ = 9136858608.

The previous prime is 17131609889. The next prime is 17131609907. The reversal of 17131609905 is 50990613171.

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

It is not a de Polignac number, because 17131609905 - 24 = 17131609889 is a prime.

It is a Curzon number.

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

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

Almost surely, 217131609905 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 1142107335.

The product of its (nonzero) digits is 51030, while the sum is 42.

The spelling of 17131609905 in words is "seventeen billion, one hundred thirty-one million, six hundred nine thousand, nine hundred five".

Divisors: 1 3 5 15 1142107327 3426321981 5710536635 17131609905