Base | Representation |
---|---|
bin | 1001001101000011011… |
… | …00000110101100110001 |
3 | 1010020021200100002100002 |
4 | 10212201230012230301 |
5 | 20140132244244121 |
6 | 401140414235345 |
7 | 31563565515101 |
oct | 4464154065461 |
9 | 1106250302302 |
10 | 316245306161 |
11 | 11213425a264 |
12 | 51359ab5b55 |
13 | 23a8b672bc5 |
14 | 114408cb201 |
15 | 835d9ace0b |
hex | 49a1b06b31 |
316245306161 has 2 divisors, whose sum is σ = 316245306162. Its totient is φ = 316245306160.
The previous prime is 316245306133. The next prime is 316245306187. The reversal of 316245306161 is 161603542613.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 273466243600 + 42779062561 = 522940^2 + 206831^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-316245306161 is a prime.
It is a super-2 number, since 2×3162453061612 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (316245306101) by changing a digit.
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 as a sum of consecutive naturals, namely, 158122653080 + 158122653081.
It is an arithmetic number, because the mean of its divisors is an integer number (158122653081).
Almost surely, 2316245306161 is an apocalyptic number.
It is an amenable number.
316245306161 is a deficient number, since it is larger than the sum of its proper divisors (1).
316245306161 is an equidigital number, since it uses as much as digits as its factorization.
316245306161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 77760, while the sum is 38.
Adding to 316245306161 its reverse (161603542613), we get a palindrome (477848848774).
The spelling of 316245306161 in words is "three hundred sixteen billion, two hundred forty-five million, three hundred six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •