Base | Representation |
---|---|
bin | 111011110011010… |
… | …0010001100000000 |
3 | 12011211202100021212 |
4 | 1313212202030000 |
5 | 13102141341313 |
6 | 531040105252 |
7 | 100503510140 |
oct | 16746421400 |
9 | 5154670255 |
10 | 2006590208 |
11 | 93a738a17 |
12 | 480005228 |
13 | 25c943bac |
14 | 1506d2920 |
15 | bb2653a8 |
hex | 779a2300 |
2006590208 has 72 divisors (see below), whose sum is σ = 4596400032. Its totient is φ = 856424448.
The previous prime is 2006590199. The next prime is 2006590213. The reversal of 2006590208 is 8020956002.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 458366 + ... + 462722.
Almost surely, 22006590208 is an apocalyptic number.
2006590208 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2006590208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2298200016).
2006590208 is an abundant number, since it is smaller than the sum of its proper divisors (2589809824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2006590208 is an equidigital number, since it uses as much as digits as its factorization.
2006590208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4637 (or 4623 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 32.
The square root of 2006590208 is about 44794.9797187140. The cubic root of 2006590208 is about 1261.3033896508.
The spelling of 2006590208 in words is "two billion, six million, five hundred ninety thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •