Base | Representation |
---|---|
bin | 10000010111100… |
… | …001000100110001 |
3 | 201010201010201022 |
4 | 100113201010301 |
5 | 1030244201431 |
6 | 43125345225 |
7 | 6543030536 |
oct | 2027410461 |
9 | 633633638 |
10 | 274600241 |
11 | 131006253 |
12 | 77b68215 |
13 | 44b76966 |
14 | 28680d8d |
15 | 1919307b |
hex | 105e1131 |
274600241 has 2 divisors, whose sum is σ = 274600242. Its totient is φ = 274600240.
The previous prime is 274600211. The next prime is 274600267. The reversal of 274600241 is 142006472.
It is an a-pointer prime, because the next prime (274600267) can be obtained adding 274600241 to its sum of digits (26).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 273207841 + 1392400 = 16529^2 + 1180^2 .
It is a cyclic number.
It is not a de Polignac number, because 274600241 - 210 = 274599217 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 274600241.
It is not a weakly prime, because it can be changed into another prime (274600211) 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, 137300120 + 137300121.
It is an arithmetic number, because the mean of its divisors is an integer number (137300121).
Almost surely, 2274600241 is an apocalyptic number.
It is an amenable number.
274600241 is a deficient number, since it is larger than the sum of its proper divisors (1).
274600241 is an equidigital number, since it uses as much as digits as its factorization.
274600241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2688, while the sum is 26.
The square root of 274600241 is about 16571.0663808941. The cubic root of 274600241 is about 649.9804656851.
The spelling of 274600241 in words is "two hundred seventy-four million, six hundred thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •