Base | Representation |
---|---|
bin | 111110110010110… |
… | …0100110010010101 |
3 | 12102211200210101022 |
4 | 1331211210302111 |
5 | 13303343031010 |
6 | 545024210525 |
7 | 103133135663 |
oct | 17545446225 |
9 | 5384623338 |
10 | 2107002005 |
11 | 991390879 |
12 | 4a9769a45 |
13 | 27769cc64 |
14 | 15db8dc33 |
15 | c4e9bd55 |
hex | 7d964c95 |
2107002005 has 8 divisors (see below), whose sum is σ = 2530109400. Its totient is φ = 1684463616.
The previous prime is 2107001999. The next prime is 2107002031. The reversal of 2107002005 is 5002007012.
It can be written as a sum of positive squares in 4 ways, for example, as 381928849 + 1725073156 = 19543^2 + 41534^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2107002005 - 212 = 2106997909 is a prime.
It is a congruent number.
It is an unprimeable number.
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, 134060 + ... + 148949.
It is an arithmetic number, because the mean of its divisors is an integer number (316263675).
Almost surely, 22107002005 is an apocalyptic number.
It is an amenable number.
2107002005 is a deficient number, since it is larger than the sum of its proper divisors (423107395).
2107002005 is a wasteful number, since it uses less digits than its factorization.
2107002005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 284503.
The product of its (nonzero) digits is 140, while the sum is 17.
The square root of 2107002005 is about 45902.0915100826. The cubic root of 2107002005 is about 1282.0008593318. Note that the first 3 decimals are identical.
Adding to 2107002005 its reverse (5002007012), we get a palindrome (7109009017).
The spelling of 2107002005 in words is "two billion, one hundred seven million, two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •