Base | Representation |
---|---|
bin | 1000111101110000… |
… | …0010001000011001 |
3 | 20012201020101120022 |
4 | 2033130002020121 |
5 | 14412030200044 |
6 | 1034443240225 |
7 | 113430555503 |
oct | 21734021031 |
9 | 6181211508 |
10 | 2406490649 |
11 | 1025446052 |
12 | 571b19075 |
13 | 2c474c084 |
14 | 18b86cd73 |
15 | e14093ee |
hex | 8f702219 |
2406490649 has 4 divisors (see below), whose sum is σ = 2408141520. Its totient is φ = 2404839780.
The previous prime is 2406490637. The next prime is 2406490651. The reversal of 2406490649 is 9460946042.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 9460946042 = 2 ⋅4730473021.
It is a cyclic number.
It is not a de Polignac number, because 2406490649 - 28 = 2406490393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2406490609) 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 in 3 ways as a sum of consecutive naturals, for example, 823247 + ... + 826164.
It is an arithmetic number, because the mean of its divisors is an integer number (602035380).
Almost surely, 22406490649 is an apocalyptic number.
It is an amenable number.
2406490649 is a deficient number, since it is larger than the sum of its proper divisors (1650871).
2406490649 is a wasteful number, since it uses less digits than its factorization.
2406490649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1650870.
The product of its (nonzero) digits is 373248, while the sum is 44.
The square root of 2406490649 is about 49055.9950362848. The cubic root of 2406490649 is about 1340.0717732775.
The spelling of 2406490649 in words is "two billion, four hundred six million, four hundred ninety thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •