Base | Representation |
---|---|
bin | 10000010101011… |
… | …110011011110001 |
3 | 201002200221200122 |
4 | 100111132123301 |
5 | 1030130041022 |
6 | 43110100025 |
7 | 6535341503 |
oct | 2025363361 |
9 | 632627618 |
10 | 274065137 |
11 | 130780215 |
12 | 7794a615 |
13 | 44a1a228 |
14 | 28581d73 |
15 | 190d9742 |
hex | 1055e6f1 |
274065137 has 2 divisors, whose sum is σ = 274065138. Its totient is φ = 274065136.
The previous prime is 274065097. The next prime is 274065161. The reversal of 274065137 is 731560472.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 273703936 + 361201 = 16544^2 + 601^2 .
It is a cyclic number.
It is not a de Polignac number, because 274065137 - 26 = 274065073 is a prime.
It is a super-2 number, since 2×2740651372 = 150223398637657538, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 274065097 and 274065106.
It is not a weakly prime, because it can be changed into another prime (274065437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 137032568 + 137032569.
It is an arithmetic number, because the mean of its divisors is an integer number (137032569).
Almost surely, 2274065137 is an apocalyptic number.
It is an amenable number.
274065137 is a deficient number, since it is larger than the sum of its proper divisors (1).
274065137 is an equidigital number, since it uses as much as digits as its factorization.
274065137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35280, while the sum is 35.
The square root of 274065137 is about 16554.9127753667. The cubic root of 274065137 is about 649.5579929897.
The spelling of 274065137 in words is "two hundred seventy-four million, sixty-five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •