Base | Representation |
---|---|
bin | 110110111001001100010101… |
… | …000110011010011001000101 |
3 | 1011122210222111200010122001022 |
4 | 312321030111012122121011 |
5 | 223121000402213143312 |
6 | 2213245000503440525 |
7 | 101565235426333013 |
oct | 6671142506323105 |
9 | 1148728450118038 |
10 | 241424760677957 |
11 | 6aa1a73652151a |
12 | 230b189ba56145 |
13 | a49334622262c |
14 | 4389040d958b3 |
15 | 1cda02aab8172 |
hex | db931519a645 |
241424760677957 has 2 divisors, whose sum is σ = 241424760677958. Its totient is φ = 241424760677956.
The previous prime is 241424760677927. The next prime is 241424760677981. The reversal of 241424760677957 is 759776067424142.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 145004321067076 + 96420439610881 = 12041774^2 + 9819391^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-241424760677957 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (241424760677927) 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, 120712380338978 + 120712380338979.
It is an arithmetic number, because the mean of its divisors is an integer number (120712380338979).
Almost surely, 2241424760677957 is an apocalyptic number.
It is an amenable number.
241424760677957 is a deficient number, since it is larger than the sum of its proper divisors (1).
241424760677957 is an equidigital number, since it uses as much as digits as its factorization.
241424760677957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 995742720, while the sum is 71.
The spelling of 241424760677957 in words is "two hundred forty-one trillion, four hundred twenty-four billion, seven hundred sixty million, six hundred seventy-seven thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •