Base | Representation |
---|---|
bin | 11111111000000100… |
… | …00100110101010101 |
3 | 1122011122200221100002 |
4 | 33330002010311111 |
5 | 240022001220110 |
6 | 11510045301045 |
7 | 1144040454521 |
oct | 177402046525 |
9 | 48148627302 |
10 | 17113304405 |
11 | 729201798a |
12 | 3397264785 |
13 | 17c9614832 |
14 | b84b74d81 |
15 | 6a2608aa5 |
hex | 3fc084d55 |
17113304405 has 32 divisors (see below), whose sum is σ = 22512803040. Its totient is φ = 12430458880.
The previous prime is 17113304363. The next prime is 17113304441. The reversal of 17113304405 is 50440331171.
17113304405 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 16 ways, for example, as 1286154769 + 15827149636 = 35863^2 + 125806^2 .
It is not a de Polignac number, because 17113304405 - 216 = 17113238869 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4033085 + ... + 4037325.
It is an arithmetic number, because the mean of its divisors is an integer number (703525095).
Almost surely, 217113304405 is an apocalyptic number.
It is an amenable number.
17113304405 is a deficient number, since it is larger than the sum of its proper divisors (5399498635).
17113304405 is a wasteful number, since it uses less digits than its factorization.
17113304405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5929.
The product of its (nonzero) digits is 5040, while the sum is 29.
Adding to 17113304405 its reverse (50440331171), we get a palindrome (67553635576).
The spelling of 17113304405 in words is "seventeen billion, one hundred thirteen million, three hundred four thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •