Base | Representation |
---|---|
bin | 11101001110001000001… |
… | …010111110101000000000 |
3 | 21002222002100210220121201 |
4 | 131032020022332220000 |
5 | 230344423240302220 |
6 | 4134251144030544 |
7 | 265034650661242 |
oct | 35161012765000 |
9 | 7088070726551 |
10 | 2008034306560 |
11 | 70466a020267 |
12 | 285206762454 |
13 | 117483c29719 |
14 | 6d291928092 |
15 | 37378502d0a |
hex | 1d3882bea00 |
2008034306560 has 80 divisors (see below), whose sum is σ = 4842406992456. Its totient is φ = 798570692608.
The previous prime is 2008034306519. The next prime is 2008034306561. The reversal of 2008034306560 is 656034308002.
It can be written as a sum of positive squares in 4 ways, for example, as 1982418944256 + 25615362304 = 1407984^2 + 160048^2 .
It is a tau number, because it is divible by the number of its divisors (80).
It is not an unprimeable number, because it can be changed into a prime (2008034306561) 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 7 ways as a sum of consecutive naturals, for example, 1824139 + ... + 2709898.
Almost surely, 22008034306560 is an apocalyptic number.
2008034306560 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2008034306560 is an abundant number, since it is smaller than the sum of its proper divisors (2834372685896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2008034306560 is an equidigital number, since it uses as much as digits as its factorization.
2008034306560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4534233 (or 4534217 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 37.
The spelling of 2008034306560 in words is "two trillion, eight billion, thirty-four million, three hundred six thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •