Base | Representation |
---|---|
bin | 111011110010001… |
… | …0011010111010111 |
3 | 12011210122121211011 |
4 | 1313210103113113 |
5 | 13102014131312 |
6 | 531015353051 |
7 | 100465522453 |
oct | 16744232727 |
9 | 5153577734 |
10 | 2006005207 |
11 | 93a379448 |
12 | 47b982787 |
13 | 25c79a83b |
14 | 1505bd663 |
15 | bb19bda7 |
hex | 779135d7 |
2006005207 has 4 divisors (see below), whose sum is σ = 2017212120. Its totient is φ = 1994798296.
The previous prime is 2006005201. The next prime is 2006005213. The reversal of 2006005207 is 7025006002.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (2006005201) and next prime (2006005213).
It is a cyclic number.
It is not a de Polignac number, because 2006005207 - 211 = 2006003159 is a prime.
It is a super-2 number, since 2×20060052072 = 8048113781022225698, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2006005201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5603188 + ... + 5603545.
It is an arithmetic number, because the mean of its divisors is an integer number (504303030).
Almost surely, 22006005207 is an apocalyptic number.
2006005207 is a deficient number, since it is larger than the sum of its proper divisors (11206913).
2006005207 is a wasteful number, since it uses less digits than its factorization.
2006005207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11206912.
The product of its (nonzero) digits is 840, while the sum is 22.
The square root of 2006005207 is about 44788.4494819814. The cubic root of 2006005207 is about 1261.1808043386.
The spelling of 2006005207 in words is "two billion, six million, five thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •