Base | Representation |
---|---|
bin | 1111111100111011101… |
… | …0010001110001110001 |
3 | 222012101022120002101201 |
4 | 3333032322101301301 |
5 | 13442230401321223 |
6 | 325522051131201 |
7 | 25541215212151 |
oct | 3771672216161 |
9 | 865338502351 |
10 | 274054323313 |
11 | a62535803a1 |
12 | 451442a3b01 |
13 | 1cac66c83b4 |
14 | d39b34c761 |
15 | 71de98aead |
hex | 3fcee91c71 |
274054323313 has 2 divisors, whose sum is σ = 274054323314. Its totient is φ = 274054323312.
The previous prime is 274054323227. The next prime is 274054323331. The reversal of 274054323313 is 313323450472.
Together with next prime (274054323331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 221132241009 + 52922082304 = 470247^2 + 230048^2 .
It is a cyclic number.
It is not a de Polignac number, because 274054323313 - 213 = 274054315121 is a prime.
It is not a weakly prime, because it can be changed into another prime (274054323353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 137027161656 + 137027161657.
It is an arithmetic number, because the mean of its divisors is an integer number (137027161657).
Almost surely, 2274054323313 is an apocalyptic number.
It is an amenable number.
274054323313 is a deficient number, since it is larger than the sum of its proper divisors (1).
274054323313 is an equidigital number, since it uses as much as digits as its factorization.
274054323313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 181440, while the sum is 37.
Adding to 274054323313 its reverse (313323450472), we get a palindrome (587377773785).
The spelling of 274054323313 in words is "two hundred seventy-four billion, fifty-four million, three hundred twenty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •