Base | Representation |
---|---|
bin | 111110110001000111101000… |
… | …010101000010101101101101 |
3 | 1100012102112110221212022211001 |
4 | 332301013220111002231231 |
5 | 242140333232144033221 |
6 | 2415041335302400301 |
7 | 112101160443132115 |
oct | 7661075025025555 |
9 | 1305375427768731 |
10 | 276054330846061 |
11 | 7aa60a9104a699 |
12 | 26b65218a30091 |
13 | bb05a723c49a1 |
14 | 4c2515ac42045 |
15 | 21dac176db391 |
hex | fb11e8542b6d |
276054330846061 has 2 divisors, whose sum is σ = 276054330846062. Its totient is φ = 276054330846060.
The previous prime is 276054330846037. The next prime is 276054330846079. The reversal of 276054330846061 is 160648033450672.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 274979803725225 + 1074527120836 = 16582515^2 + 1036594^2 .
It is a cyclic number.
It is not a de Polignac number, because 276054330846061 - 225 = 276054297291629 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 276054330845993 and 276054330846011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (276054370846061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 138027165423030 + 138027165423031.
It is an arithmetic number, because the mean of its divisors is an integer number (138027165423031).
Almost surely, 2276054330846061 is an apocalyptic number.
It is an amenable number.
276054330846061 is a deficient number, since it is larger than the sum of its proper divisors (1).
276054330846061 is an equidigital number, since it uses as much as digits as its factorization.
276054330846061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17418240, while the sum is 55.
The spelling of 276054330846061 in words is "two hundred seventy-six trillion, fifty-four billion, three hundred thirty million, eight hundred forty-six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.038 sec. • engine limits •