Base | Representation |
---|---|
bin | 1101111111101000101… |
… | …1000010101110111001 |
3 | 211222120022101202110101 |
4 | 3133322023002232321 |
5 | 12414340110300212 |
6 | 302240403315401 |
7 | 23240561452645 |
oct | 3377213025671 |
9 | 758508352411 |
10 | 240420400057 |
11 | 92a64059002 |
12 | 3a71837bb61 |
13 | 19896506566 |
14 | b8ca443c25 |
15 | 63c1cee157 |
hex | 37fa2c2bb9 |
240420400057 has 2 divisors, whose sum is σ = 240420400058. Its totient is φ = 240420400056.
The previous prime is 240420399991. The next prime is 240420400069. The reversal of 240420400057 is 750004024042.
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., 196010738361 + 44409661696 = 442731^2 + 210736^2 .
It is a cyclic number.
It is not a de Polignac number, because 240420400057 - 223 = 240412011449 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 240420399998 and 240420400034.
It is not a weakly prime, because it can be changed into another prime (240420400097) 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, 120210200028 + 120210200029.
It is an arithmetic number, because the mean of its divisors is an integer number (120210200029).
Almost surely, 2240420400057 is an apocalyptic number.
It is an amenable number.
240420400057 is a deficient number, since it is larger than the sum of its proper divisors (1).
240420400057 is an equidigital number, since it uses as much as digits as its factorization.
240420400057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8960, while the sum is 28.
Adding to 240420400057 its reverse (750004024042), we get a palindrome (990424424099).
The spelling of 240420400057 in words is "two hundred forty billion, four hundred twenty million, four hundred thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •