Base | Representation |
---|---|
bin | 1000111100001101… |
… | …0010000110001001 |
3 | 20012021000202102022 |
4 | 2033003102012021 |
5 | 14403400034231 |
6 | 1034052214225 |
7 | 113321453444 |
oct | 21703220611 |
9 | 6167022368 |
10 | 2400002441 |
11 | 10218143a1 |
12 | 56b90a375 |
13 | 2c32b9ab5 |
14 | 18aa6065b |
15 | e0a76c7b |
hex | 8f0d2189 |
2400002441 has 2 divisors, whose sum is σ = 2400002442. Its totient is φ = 2400002440.
The previous prime is 2400002401. The next prime is 2400002443. The reversal of 2400002441 is 1442000042.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2379390841 + 20611600 = 48779^2 + 4540^2 .
It is a cyclic number.
It is not a de Polignac number, because 2400002441 - 218 = 2399740297 is a prime.
It is a Sophie Germain prime.
Together with 2400002443, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (2400002443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1200001220 + 1200001221.
It is an arithmetic number, because the mean of its divisors is an integer number (1200001221).
Almost surely, 22400002441 is an apocalyptic number.
It is an amenable number.
2400002441 is a deficient number, since it is larger than the sum of its proper divisors (1).
2400002441 is an equidigital number, since it uses as much as digits as its factorization.
2400002441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 17.
The square root of 2400002441 is about 48989.8197690092. The cubic root of 2400002441 is about 1338.8663540769.
Adding to 2400002441 its reverse (1442000042), we get a palindrome (3842002483).
The spelling of 2400002441 in words is "two billion, four hundred million, two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •