Base | Representation |
---|---|
bin | 1011111100110000… |
… | …01101001100010101 |
3 | 121120002102001121202 |
4 | 11332120031030111 |
5 | 101114300221010 |
6 | 2540324522245 |
7 | 314655441314 |
oct | 57630151425 |
9 | 17502361552 |
10 | 6415242005 |
11 | 27a22672a7 |
12 | 12b0550385 |
13 | 7b3115bb3 |
14 | 44c02027b |
15 | 27830c6a5 |
hex | 17e60d315 |
6415242005 has 8 divisors (see below), whose sum is σ = 7795737600. Its totient is φ = 5067228816.
The previous prime is 6415241999. The next prime is 6415242007. The reversal of 6415242005 is 5002425146.
6415242005 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6415242005 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6415242007) 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, 8120165 + ... + 8120954.
It is an arithmetic number, because the mean of its divisors is an integer number (974467200).
Almost surely, 26415242005 is an apocalyptic number.
It is an amenable number.
6415242005 is a deficient number, since it is larger than the sum of its proper divisors (1380495595).
6415242005 is a wasteful number, since it uses less digits than its factorization.
6415242005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16241203.
The product of its (nonzero) digits is 9600, while the sum is 29.
The square root of 6415242005 is about 80095.2058802523. The cubic root of 6415242005 is about 1858.1082632677.
The spelling of 6415242005 in words is "six billion, four hundred fifteen million, two hundred forty-two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •