Base | Representation |
---|---|
bin | 111111110000… |
… | …001001000101 |
3 | 1011110001220122 |
4 | 333300021011 |
5 | 13234243021 |
6 | 1354111325 |
7 | 262023536 |
oct | 77601105 |
9 | 34401818 |
10 | 16712261 |
11 | 9485195 |
12 | 571b545 |
13 | 3601b17 |
14 | 231068d |
15 | 1701bab |
hex | ff0245 |
16712261 has 2 divisors, whose sum is σ = 16712262. Its totient is φ = 16712260.
The previous prime is 16712257. The next prime is 16712263. The reversal of 16712261 is 16221761.
16712261 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16048036 + 664225 = 4006^2 + 815^2 .
It is an emirp because it is prime and its reverse (16221761) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16712261 - 22 = 16712257 is a prime.
Together with 16712263, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 16712261.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16712263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8356130 + 8356131.
It is an arithmetic number, because the mean of its divisors is an integer number (8356131).
Almost surely, 216712261 is an apocalyptic number.
It is an amenable number.
16712261 is a deficient number, since it is larger than the sum of its proper divisors (1).
16712261 is an equidigital number, since it uses as much as digits as its factorization.
16712261 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1008, while the sum is 26.
The square root of 16712261 is about 4088.0632333661. The cubic root of 16712261 is about 255.6691944998.
The spelling of 16712261 in words is "sixteen million, seven hundred twelve thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •