Base | Representation |
---|---|
bin | 111011110110110… |
… | …1100111010000101 |
3 | 12011222021210200101 |
4 | 1313231230322011 |
5 | 13103132003000 |
6 | 531144244101 |
7 | 100525464055 |
oct | 16755547205 |
9 | 5158253611 |
10 | 2008469125 |
11 | 940801643 |
12 | 480770631 |
13 | 260151190 |
14 | 150a61565 |
15 | bb4d6e6a |
hex | 77b6ce85 |
2008469125 has 16 divisors (see below), whose sum is σ = 2699384688. Its totient is φ = 1483176000.
The previous prime is 2008469123. The next prime is 2008469149. The reversal of 2008469125 is 5219648002.
It can be written as a sum of positive squares in 8 ways, for example, as 1641708324 + 366760801 = 40518^2 + 19151^2 .
It is not a de Polignac number, because 2008469125 - 21 = 2008469123 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2008469123) 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 15 ways as a sum of consecutive naturals, for example, 616366 + ... + 619615.
It is an arithmetic number, because the mean of its divisors is an integer number (168711543).
Almost surely, 22008469125 is an apocalyptic number.
2008469125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2008469125 is a deficient number, since it is larger than the sum of its proper divisors (690915563).
2008469125 is a wasteful number, since it uses less digits than its factorization.
2008469125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1236009 (or 1235999 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 37.
The square root of 2008469125 is about 44815.9472174805. The cubic root of 2008469125 is about 1261.6969503386.
The spelling of 2008469125 in words is "two billion, eight million, four hundred sixty-nine thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •