Base | Representation |
---|---|
bin | 111011110100001… |
… | …1111110101000000 |
3 | 12011212201111020000 |
4 | 1313220133311000 |
5 | 13102304323312 |
6 | 531055120000 |
7 | 100511052405 |
oct | 16750376500 |
9 | 5155644200 |
10 | 2007104832 |
11 | 93aa5a627 |
12 | 480213000 |
13 | 25ca941c5 |
14 | 1507c82ac |
15 | bb317adc |
hex | 77a1fd40 |
2007104832 has 70 divisors (see below), whose sum is σ = 5949702858. Its totient is φ = 669033216.
The previous prime is 2007104807. The next prime is 2007104839. The reversal of 2007104832 is 2384017002.
It can be written as a sum of positive squares in only one way, i.e., 2005606656 + 1498176 = 44784^2 + 1224^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 2007104796 and 2007104805.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2007104839) 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 9 ways as a sum of consecutive naturals, for example, 188403 + ... + 198770.
Almost surely, 22007104832 is an apocalyptic number.
It is an amenable number.
2007104832 is an abundant number, since it is smaller than the sum of its proper divisors (3942598026).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2007104832 is an equidigital number, since it uses as much as digits as its factorization.
2007104832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 387197 (or 387178 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
The square root of 2007104832 is about 44800.7235655854. The cubic root of 2007104832 is about 1261.4112079637.
The spelling of 2007104832 in words is "two billion, seven million, one hundred four thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •