Base | Representation |
---|---|
bin | 1001000101110110… |
… | …1101111000001101 |
3 | 20022002012112222200 |
4 | 2101131231320031 |
5 | 14444231031123 |
6 | 1042100032113 |
7 | 114322535511 |
oct | 22135557015 |
9 | 6262175880 |
10 | 2440486413 |
11 | 1042655622 |
12 | 581392639 |
13 | 2cb7c2a01 |
14 | 19219c141 |
15 | e43c2143 |
hex | 9176de0d |
2440486413 has 12 divisors (see below), whose sum is σ = 3527625660. Its totient is φ = 1625846976.
The previous prime is 2440486393. The next prime is 2440486417. The reversal of 2440486413 is 3146840442.
2440486413 is a `hidden beast` number, since 2 + 4 + 4 + 0 + 4 + 8 + 641 + 3 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 2326808169 + 113678244 = 48237^2 + 10662^2 .
It is not a de Polignac number, because 2440486413 - 25 = 2440486381 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2440486417) 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 11 ways as a sum of consecutive naturals, for example, 81718 + ... + 107511.
It is an arithmetic number, because the mean of its divisors is an integer number (293968805).
Almost surely, 22440486413 is an apocalyptic number.
It is an amenable number.
2440486413 is a deficient number, since it is larger than the sum of its proper divisors (1087139247).
2440486413 is a wasteful number, since it uses less digits than its factorization.
2440486413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190668 (or 190665 counting only the distinct ones).
The product of its (nonzero) digits is 73728, while the sum is 36.
The square root of 2440486413 is about 49401.2794672365. The cubic root of 2440486413 is about 1346.3525525082.
The spelling of 2440486413 in words is "two billion, four hundred forty million, four hundred eighty-six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •