Base | Representation |
---|---|
bin | 111011110011101… |
… | …1001000000011101 |
3 | 12011212011202022012 |
4 | 1313213121000131 |
5 | 13102221032444 |
6 | 531045001005 |
7 | 100505433602 |
oct | 16747310035 |
9 | 5155152265 |
10 | 2006814749 |
11 | 93a881695 |
12 | 4800b3165 |
13 | 25c9c2164 |
14 | 1507506a9 |
15 | bb2abb9e |
hex | 779d901d |
2006814749 has 4 divisors (see below), whose sum is σ = 2034305436. Its totient is φ = 1979324064.
The previous prime is 2006814739. The next prime is 2006814763. The reversal of 2006814749 is 9474186002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 902581849 + 1104232900 = 30043^2 + 33230^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2006814749 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2006814739) 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 3 ways as a sum of consecutive naturals, for example, 13745234 + ... + 13745379.
It is an arithmetic number, because the mean of its divisors is an integer number (508576359).
Almost surely, 22006814749 is an apocalyptic number.
It is an amenable number.
2006814749 is a deficient number, since it is larger than the sum of its proper divisors (27490687).
2006814749 is an equidigital number, since it uses as much as digits as its factorization.
2006814749 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27490686.
The product of its (nonzero) digits is 96768, while the sum is 41.
The square root of 2006814749 is about 44797.4859674067. The cubic root of 2006814749 is about 1261.3504352575.
The spelling of 2006814749 in words is "two billion, six million, eight hundred fourteen thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •