Base | Representation |
---|---|
bin | 100011111101110000100100… |
… | …1000010011000001000010111 |
3 | 1112111002220002120100112120211 |
4 | 1013323201021002120020113 |
5 | 312431100014121422241 |
6 | 3040453444145110251 |
7 | 123430426012553365 |
oct | 10773411102301027 |
9 | 1474086076315524 |
10 | 316351336514071 |
11 | 91887937222021 |
12 | 2b593012628387 |
13 | 10769a5933c671 |
14 | 58196b48d0635 |
15 | 2689056c92781 |
hex | 11fb849098217 |
316351336514071 has 2 divisors, whose sum is σ = 316351336514072. Its totient is φ = 316351336514070.
The previous prime is 316351336514021. The next prime is 316351336514077. The reversal of 316351336514071 is 170415633153613.
It is a strong prime.
It is an emirp because it is prime and its reverse (170415633153613) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 316351336514071 - 229 = 316350799643159 is a prime.
It is a super-2 number, since 2×3163513365140712 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (316351336514077) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 158175668257035 + 158175668257036.
It is an arithmetic number, because the mean of its divisors is an integer number (158175668257036).
Almost surely, 2316351336514071 is an apocalyptic number.
316351336514071 is a deficient number, since it is larger than the sum of its proper divisors (1).
316351336514071 is an equidigital number, since it uses as much as digits as its factorization.
316351336514071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2041200, while the sum is 49.
Adding to 316351336514071 its reverse (170415633153613), we get a palindrome (486766969667684).
The spelling of 316351336514071 in words is "three hundred sixteen trillion, three hundred fifty-one billion, three hundred thirty-six million, five hundred fourteen thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •