Base | Representation |
---|---|
bin | 1001010011110011001001 |
3 | 11120222120221 |
4 | 21103303021 |
5 | 1111043033 |
6 | 124150041 |
7 | 26512564 |
oct | 11236311 |
9 | 4528527 |
10 | 2440393 |
11 | 141755a |
12 | 998321 |
13 | 675a27 |
14 | 4774db |
15 | 33312d |
hex | 253cc9 |
2440393 has 2 divisors, whose sum is σ = 2440394. Its totient is φ = 2440392.
The previous prime is 2440391. The next prime is 2440411. The reversal of 2440393 is 3930442.
2440393 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1882384 + 558009 = 1372^2 + 747^2 .
It is a cyclic number.
It is not a de Polignac number, because 2440393 - 21 = 2440391 is a prime.
Together with 2440391, it forms a pair of twin primes.
It is equal to p179017 and since 2440393 and 179017 have the same sum of digits, it is a Honaker prime.
It is a nialpdrome in base 12.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2440391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1220196 + 1220197.
It is an arithmetic number, because the mean of its divisors is an integer number (1220197).
22440393 is an apocalyptic number.
It is an amenable number.
2440393 is a deficient number, since it is larger than the sum of its proper divisors (1).
2440393 is an equidigital number, since it uses as much as digits as its factorization.
2440393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 25.
The square root of 2440393 is about 1562.1757263509. The cubic root of 2440393 is about 134.6335374452.
The spelling of 2440393 in words is "two million, four hundred forty thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •