Base | Representation |
---|---|
bin | 111111000010… |
… | …100000110001 |
3 | 1011002120112102 |
4 | 333002200301 |
5 | 13212302421 |
6 | 1350110145 |
7 | 260314616 |
oct | 77024061 |
9 | 34076472 |
10 | 16525361 |
11 | 9367826 |
12 | 564b355 |
13 | 3567a28 |
14 | 22a250d |
15 | 16b660b |
hex | fc2831 |
16525361 has 2 divisors, whose sum is σ = 16525362. Its totient is φ = 16525360.
The previous prime is 16525319. The next prime is 16525363. The reversal of 16525361 is 16352561.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15555136 + 970225 = 3944^2 + 985^2 .
It is an emirp because it is prime and its reverse (16352561) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16525361 - 210 = 16524337 is a prime.
It is a Sophie Germain prime.
Together with 16525363, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (16525363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8262680 + 8262681.
It is an arithmetic number, because the mean of its divisors is an integer number (8262681).
Almost surely, 216525361 is an apocalyptic number.
It is an amenable number.
16525361 is a deficient number, since it is larger than the sum of its proper divisors (1).
16525361 is an equidigital number, since it uses as much as digits as its factorization.
16525361 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5400, while the sum is 29.
The square root of 16525361 is about 4065.1397269959. The cubic root of 16525361 is about 254.7125352158.
The spelling of 16525361 in words is "sixteen million, five hundred twenty-five thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •