Base | Representation |
---|---|
bin | 1111111101001000000… |
… | …0111000100000011001 |
3 | 222012111221112011121022 |
4 | 3333102000320200121 |
5 | 13442332213331312 |
6 | 325531151052225 |
7 | 25542416561561 |
oct | 3772200704031 |
9 | 865457464538 |
10 | 274106386457 |
11 | a627aa00192 |
12 | 45159811075 |
13 | 1cb044268a7 |
14 | d3a4221da1 |
15 | 71e4322172 |
hex | 3fd2038819 |
274106386457 has 2 divisors, whose sum is σ = 274106386458. Its totient is φ = 274106386456.
The previous prime is 274106386451. The next prime is 274106386493. The reversal of 274106386457 is 754683601472.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 155018588176 + 119087798281 = 393724^2 + 345091^2 .
It is a cyclic number.
It is not a de Polignac number, because 274106386457 - 24 = 274106386441 is a prime.
It is a super-2 number, since 2×2741063864572 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 274106386399 and 274106386408.
It is not a weakly prime, because it can be changed into another prime (274106386451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 137053193228 + 137053193229.
It is an arithmetic number, because the mean of its divisors is an integer number (137053193229).
Almost surely, 2274106386457 is an apocalyptic number.
It is an amenable number.
274106386457 is a deficient number, since it is larger than the sum of its proper divisors (1).
274106386457 is an equidigital number, since it uses as much as digits as its factorization.
274106386457 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6773760, while the sum is 53.
The spelling of 274106386457 in words is "two hundred seventy-four billion, one hundred six million, three hundred eighty-six thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •