Base | Representation |
---|---|
bin | 1001000101110100… |
… | …0101110101110101 |
3 | 20022001220020000220 |
4 | 2101131011311311 |
5 | 14444210304141 |
6 | 1042052324553 |
7 | 114321253425 |
oct | 22135056565 |
9 | 6261806026 |
10 | 2440322421 |
11 | 1042553399 |
12 | 581313759 |
13 | 2cb766184 |
14 | 192158485 |
15 | e438d766 |
hex | 91745d75 |
2440322421 has 8 divisors (see below), whose sum is σ = 3365962080. Its totient is φ = 1570782192.
The previous prime is 2440322393. The next prime is 2440322461. The reversal of 2440322421 is 1242230442.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2440322421 - 27 = 2440322293 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2440322391 and 2440322400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2440322461) 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 in 7 ways as a sum of consecutive naturals, for example, 14024755 + ... + 14024928.
It is an arithmetic number, because the mean of its divisors is an integer number (420745260).
Almost surely, 22440322421 is an apocalyptic number.
It is an amenable number.
2440322421 is a deficient number, since it is larger than the sum of its proper divisors (925639659).
2440322421 is a wasteful number, since it uses less digits than its factorization.
2440322421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28049715.
The product of its (nonzero) digits is 3072, while the sum is 24.
The square root of 2440322421 is about 49399.6196442847. The cubic root of 2440322421 is about 1346.3223951330.
Adding to 2440322421 its reverse (1242230442), we get a palindrome (3682552863).
The spelling of 2440322421 in words is "two billion, four hundred forty million, three hundred twenty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •