Base | Representation |
---|---|
bin | 111011110110101… |
… | …1100100001010100 |
3 | 12011222011101121102 |
4 | 1313231130201110 |
5 | 13103122331004 |
6 | 531143005232 |
7 | 100525064300 |
oct | 16755344124 |
9 | 5158141542 |
10 | 2008402004 |
11 | 940766174 |
12 | 480739818 |
13 | 26012976b |
14 | 150a44d00 |
15 | bb4c211e |
hex | 77b5c854 |
2008402004 has 36 divisors (see below), whose sum is σ = 4109794164. Its totient is φ = 856267776.
The previous prime is 2008401961. The next prime is 2008402013. The reversal of 2008402004 is 4002048002.
It can be written as a sum of positive squares in 2 ways, for example, as 1009968400 + 998433604 = 31780^2 + 31598^2 .
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 11 ways as a sum of consecutive naturals, for example, 11282 + ... + 64374.
It is an arithmetic number, because the mean of its divisors is an integer number (114160949).
Almost surely, 22008402004 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2008402004, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2054897082).
2008402004 is an abundant number, since it is smaller than the sum of its proper divisors (2101392160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2008402004 is a wasteful number, since it uses less digits than its factorization.
2008402004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53304 (or 53295 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 20.
The square root of 2008402004 is about 44815.1983594851. The cubic root of 2008402004 is about 1261.6828953047.
The spelling of 2008402004 in words is "two billion, eight million, four hundred two thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •