Base | Representation |
---|---|
bin | 1001001100111000010… |
… | …11010100110010001001 |
3 | 1010020001020022122210121 |
4 | 10212130023110302021 |
5 | 20134440110431032 |
6 | 401123312143241 |
7 | 31561363455436 |
oct | 4463413246211 |
9 | 1106036278717 |
10 | 316152827017 |
11 | 112097035315 |
12 | 51332b37b21 |
13 | 23a75463711 |
14 | 114324d6b8d |
15 | 83557e1a97 |
hex | 499c2d4c89 |
316152827017 has 2 divisors, whose sum is σ = 316152827018. Its totient is φ = 316152827016.
The previous prime is 316152826999. The next prime is 316152827071. The reversal of 316152827017 is 710728251613.
Together with next prime (316152827071) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 200790025216 + 115362801801 = 448096^2 + 339651^2 .
It is a cyclic number.
It is not a de Polignac number, because 316152827017 - 211 = 316152824969 is a prime.
It is a super-2 number, since 2×3161528270172 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (316152827917) 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, 158076413508 + 158076413509.
It is an arithmetic number, because the mean of its divisors is an integer number (158076413509).
Almost surely, 2316152827017 is an apocalyptic number.
It is an amenable number.
316152827017 is a deficient number, since it is larger than the sum of its proper divisors (1).
316152827017 is an equidigital number, since it uses as much as digits as its factorization.
316152827017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 141120, while the sum is 43.
The spelling of 316152827017 in words is "three hundred sixteen billion, one hundred fifty-two million, eight hundred twenty-seven thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •