Base | Representation |
---|---|
bin | 10010110110111… |
… | …111001011110101 |
3 | 211001101000100001 |
4 | 102312333023311 |
5 | 1121444420334 |
6 | 51221351301 |
7 | 10561252003 |
oct | 2266771365 |
9 | 731330301 |
10 | 316404469 |
11 | 1526693a7 |
12 | 89b68531 |
13 | 507227a4 |
14 | 30043a73 |
15 | 1cb9e714 |
hex | 12dbf2f5 |
316404469 has 2 divisors, whose sum is σ = 316404470. Its totient is φ = 316404468.
The previous prime is 316404409. The next prime is 316404481. The reversal of 316404469 is 964404613.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 308423844 + 7980625 = 17562^2 + 2825^2 .
It is a cyclic number.
It is not a de Polignac number, because 316404469 - 29 = 316403957 is a prime.
It is a super-2 number, since 2×3164044692 = 200223576006343922, which contains 22 as substring.
It is equal to p17091766 and since 316404469 and 17091766 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (316404409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 158202234 + 158202235.
It is an arithmetic number, because the mean of its divisors is an integer number (158202235).
Almost surely, 2316404469 is an apocalyptic number.
It is an amenable number.
316404469 is a deficient number, since it is larger than the sum of its proper divisors (1).
316404469 is an equidigital number, since it uses as much as digits as its factorization.
316404469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 62208, while the sum is 37.
The square root of 316404469 is about 17787.7617760077. The cubic root of 316404469 is about 681.4189437746.
The spelling of 316404469 in words is "three hundred sixteen million, four hundred four thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •