Base | Representation |
---|---|
bin | 10000010111111… |
… | …101011000000001 |
3 | 201010221000201122 |
4 | 100113331120001 |
5 | 1030311404121 |
6 | 43132042025 |
7 | 6544022516 |
oct | 2027753001 |
9 | 633830648 |
10 | 274716161 |
11 | 131085355 |
12 | 78003315 |
13 | 44bb7655 |
14 | 286b130d |
15 | 191b75ab |
hex | 105fd601 |
274716161 has 2 divisors, whose sum is σ = 274716162. Its totient is φ = 274716160.
The previous prime is 274716149. The next prime is 274716173. The reversal of 274716161 is 161617472.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (274716149) and next prime (274716173).
It can be written as a sum of positive squares in only one way, i.e., 245079025 + 29637136 = 15655^2 + 5444^2 .
It is a cyclic number.
It is not a de Polignac number, because 274716161 - 210 = 274715137 is a prime.
It is a super-2 number, since 2×2747161612 = 150937938229155842, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (274716181) 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, 137358080 + 137358081.
It is an arithmetic number, because the mean of its divisors is an integer number (137358081).
Almost surely, 2274716161 is an apocalyptic number.
It is an amenable number.
274716161 is a deficient number, since it is larger than the sum of its proper divisors (1).
274716161 is an equidigital number, since it uses as much as digits as its factorization.
274716161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14112, while the sum is 35.
The square root of 274716161 is about 16574.5636744983. The cubic root of 274716161 is about 650.0719139369.
The spelling of 274716161 in words is "two hundred seventy-four million, seven hundred sixteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •