Base | Representation |
---|---|
bin | 111110110110001111011001… |
… | …110110000010111000100101 |
3 | 1100020200011220120011210010022 |
4 | 332312033121312002320211 |
5 | 242212120022420020131 |
6 | 2415511142334404525 |
7 | 112135460112333014 |
oct | 7666173166027045 |
9 | 1306604816153108 |
10 | 276406275157541 |
11 | 8008727447aa31 |
12 | 2700147a360745 |
13 | bb2cccca3cc79 |
14 | 4c381c69d4a7b |
15 | 21e4e652a237b |
hex | fb63d9d82e25 |
276406275157541 has 2 divisors, whose sum is σ = 276406275157542. Its totient is φ = 276406275157540.
The previous prime is 276406275157517. The next prime is 276406275157543. The reversal of 276406275157541 is 145751572604672.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 258957935308900 + 17448339848641 = 16092170^2 + 4177121^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-276406275157541 is a prime.
Together with 276406275157543, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (276406275157543) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 138203137578770 + 138203137578771.
It is an arithmetic number, because the mean of its divisors is an integer number (138203137578771).
Almost surely, 2276406275157541 is an apocalyptic number.
It is an amenable number.
276406275157541 is a deficient number, since it is larger than the sum of its proper divisors (1).
276406275157541 is an equidigital number, since it uses as much as digits as its factorization.
276406275157541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 98784000, while the sum is 62.
The spelling of 276406275157541 in words is "two hundred seventy-six trillion, four hundred six billion, two hundred seventy-five million, one hundred fifty-seven thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •