Base | Representation |
---|---|
bin | 111110101010… |
… | …000101100101 |
3 | 1010220111022002 |
4 | 332222011211 |
5 | 13201102232 |
6 | 1344015045 |
7 | 256420136 |
oct | 76520545 |
9 | 33814262 |
10 | 16425317 |
11 | 92a9647 |
12 | 5601485 |
13 | 353132c |
14 | 2277c8d |
15 | 1696b62 |
hex | faa165 |
16425317 has 2 divisors, whose sum is σ = 16425318. Its totient is φ = 16425316.
The previous prime is 16425271. The next prime is 16425337. The reversal of 16425317 is 71352461.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16008001 + 417316 = 4001^2 + 646^2 .
It is an emirp because it is prime and its reverse (71352461) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16425317 - 28 = 16425061 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 16425317.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16425337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8212658 + 8212659.
It is an arithmetic number, because the mean of its divisors is an integer number (8212659).
Almost surely, 216425317 is an apocalyptic number.
It is an amenable number.
16425317 is a deficient number, since it is larger than the sum of its proper divisors (1).
16425317 is an equidigital number, since it uses as much as digits as its factorization.
16425317 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5040, while the sum is 29.
The square root of 16425317 is about 4052.8159346311. The cubic root of 16425317 is about 254.1974873073.
Adding to 16425317 its reverse (71352461), we get a palindrome (87777778).
The spelling of 16425317 in words is "sixteen million, four hundred twenty-five thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •