Base | Representation |
---|---|
bin | 1001000101101111… |
… | …1101000101100101 |
3 | 20022001100002020212 |
4 | 2101123331011211 |
5 | 14444121240141 |
6 | 1042042105205 |
7 | 114315602552 |
oct | 22133750545 |
9 | 6261302225 |
10 | 2440024421 |
11 | 104236a50a |
12 | 5811ab205 |
13 | 2cb690643 |
14 | 1920bba29 |
15 | e43302eb |
hex | 916fd165 |
2440024421 has 2 divisors, whose sum is σ = 2440024422. Its totient is φ = 2440024420.
The previous prime is 2440024393. The next prime is 2440024423. The reversal of 2440024421 is 1244200442.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1986930625 + 453093796 = 44575^2 + 21286^2 .
It is a cyclic number.
It is not a de Polignac number, because 2440024421 - 226 = 2372915557 is a prime.
Together with 2440024423, 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 (2440024423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1220012210 + 1220012211.
It is an arithmetic number, because the mean of its divisors is an integer number (1220012211).
Almost surely, 22440024421 is an apocalyptic number.
It is an amenable number.
2440024421 is a deficient number, since it is larger than the sum of its proper divisors (1).
2440024421 is an equidigital number, since it uses as much as digits as its factorization.
2440024421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2048, while the sum is 23.
The square root of 2440024421 is about 49396.6033346424. The cubic root of 2440024421 is about 1346.2675908440.
Adding to 2440024421 its reverse (1244200442), we get a palindrome (3684224863).
The spelling of 2440024421 in words is "two billion, four hundred forty million, twenty-four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •