Base | Representation |
---|---|
bin | 1001001101010110011… |
… | …00001100111001000001 |
3 | 1010020200210021220020212 |
4 | 10212223030030321001 |
5 | 20140444101340243 |
6 | 401204311043505 |
7 | 31600542463106 |
oct | 4465314147101 |
9 | 1106623256225 |
10 | 316404715073 |
11 | 112206238567 |
12 | 513a3370595 |
13 | 23ab56b75c5 |
14 | 11457b44aad |
15 | 836c99a318 |
hex | 49ab30ce41 |
316404715073 has 2 divisors, whose sum is σ = 316404715074. Its totient is φ = 316404715072.
The previous prime is 316404715019. The next prime is 316404715087. The reversal of 316404715073 is 370517404613.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 187011272704 + 129393442369 = 432448^2 + 359713^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-316404715073 is a prime.
It is a super-2 number, since 2×3164047150732 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 316404715073.
It is not a weakly prime, because it can be changed into another prime (316404765073) 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, 158202357536 + 158202357537.
It is an arithmetic number, because the mean of its divisors is an integer number (158202357537).
Almost surely, 2316404715073 is an apocalyptic number.
It is an amenable number.
316404715073 is a deficient number, since it is larger than the sum of its proper divisors (1).
316404715073 is an equidigital number, since it uses as much as digits as its factorization.
316404715073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 211680, while the sum is 41.
The spelling of 316404715073 in words is "three hundred sixteen billion, four hundred four million, seven hundred fifteen thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •