Base | Representation |
---|---|
bin | 100011111101000010111001… |
… | …0001110001100111000110101 |
3 | 1112110202111220021112111100011 |
4 | 1013322011302032030320311 |
5 | 312422443120231404142 |
6 | 3040340422333420221 |
7 | 123420354120453604 |
oct | 10772056216147065 |
9 | 1473674807474304 |
10 | 316253243231797 |
11 | 9184a27a1101a3 |
12 | 2b577bb733a671 |
13 | 10760725876381 |
14 | 5814a4aba5a3b |
15 | 2686715141417 |
hex | 11fa17238ce35 |
316253243231797 has 2 divisors, whose sum is σ = 316253243231798. Its totient is φ = 316253243231796.
The previous prime is 316253243231729. The next prime is 316253243231831. The reversal of 316253243231797 is 797132342352613.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 200507469124356 + 115745774107441 = 14160066^2 + 10758521^2 .
It is a cyclic number.
It is not a de Polignac number, because 316253243231797 - 231 = 316251095748149 is a prime.
It is a super-2 number, since 2×3162532432317972 (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 (316253243231897) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 158126621615898 + 158126621615899.
It is an arithmetic number, because the mean of its divisors is an integer number (158126621615899).
Almost surely, 2316253243231797 is an apocalyptic number.
It is an amenable number.
316253243231797 is a deficient number, since it is larger than the sum of its proper divisors (1).
316253243231797 is an equidigital number, since it uses as much as digits as its factorization.
316253243231797 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 34292160, while the sum is 58.
The spelling of 316253243231797 in words is "three hundred sixteen trillion, two hundred fifty-three billion, two hundred forty-three million, two hundred thirty-one thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •