Base | Representation |
---|---|
bin | 11111110111101011… |
… | …00000100100100101 |
3 | 1122011102111120110121 |
4 | 33323311200210211 |
5 | 240020130311044 |
6 | 11505450521541 |
7 | 1144000454341 |
oct | 177365404445 |
9 | 48142446417 |
10 | 17110010149 |
11 | 7290177961 |
12 | 33961362b1 |
13 | 17c8a3027b |
14 | b84558621 |
15 | 6a21a7984 |
hex | 3fbd60925 |
17110010149 has 2 divisors, whose sum is σ = 17110010150. Its totient is φ = 17110010148.
The previous prime is 17110010123. The next prime is 17110010219. The reversal of 17110010149 is 94101001171.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10668824100 + 6441186049 = 103290^2 + 80257^2 .
It is a cyclic number.
It is not a de Polignac number, because 17110010149 - 217 = 17109879077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (17110010849) 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 as a sum of consecutive naturals, namely, 8555005074 + 8555005075.
It is an arithmetic number, because the mean of its divisors is an integer number (8555005075).
Almost surely, 217110010149 is an apocalyptic number.
It is an amenable number.
17110010149 is a deficient number, since it is larger than the sum of its proper divisors (1).
17110010149 is an equidigital number, since it uses as much as digits as its factorization.
17110010149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 25.
The spelling of 17110010149 in words is "seventeen billion, one hundred ten million, ten thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •