Base | Representation |
---|---|
bin | 10011000101100… |
… | …10110100110001 |
3 | 102011021201212212 |
4 | 21202302310301 |
5 | 311442203032 |
6 | 23515501505 |
7 | 3652651355 |
oct | 1142626461 |
9 | 364251785 |
10 | 160116017 |
11 | 82421596 |
12 | 45757895 |
13 | 27231509 |
14 | 1739d465 |
15 | e0cbbb2 |
hex | 98b2d31 |
160116017 has 2 divisors, whose sum is σ = 160116018. Its totient is φ = 160116016.
The previous prime is 160115993. The next prime is 160116053. The reversal of 160116017 is 710611061.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 107350321 + 52765696 = 10361^2 + 7264^2 .
It is an emirp because it is prime and its reverse (710611061) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 160116017 - 26 = 160115953 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 160115983 and 160116001.
It is not a weakly prime, because it can be changed into another prime (160116067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80058008 + 80058009.
It is an arithmetic number, because the mean of its divisors is an integer number (80058009).
Almost surely, 2160116017 is an apocalyptic number.
It is an amenable number.
160116017 is a deficient number, since it is larger than the sum of its proper divisors (1).
160116017 is an equidigital number, since it uses as much as digits as its factorization.
160116017 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 23.
The square root of 160116017 is about 12653.6957842363. The cubic root of 160116017 is about 543.0147076951.
Adding to 160116017 its reverse (710611061), we get a palindrome (870727078).
The spelling of 160116017 in words is "one hundred sixty million, one hundred sixteen thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •