Base | Representation |
---|---|
bin | 111011101110010… |
… | …1111111111110100 |
3 | 12011122221000221110 |
4 | 1313130233333310 |
5 | 13101012302312 |
6 | 530505115020 |
7 | 100442635311 |
oct | 16734577764 |
9 | 5148830843 |
10 | 2004025332 |
11 | 939246991 |
12 | 47b188a70 |
13 | 25c25660a |
14 | 150225d08 |
15 | bae0a43c |
hex | 7772fff4 |
2004025332 has 24 divisors (see below), whose sum is σ = 4681656000. Its totient is φ = 667208896.
The previous prime is 2004025319. The next prime is 2004025369. The reversal of 2004025332 is 2335204002.
It is a super-2 number, since 2×20040253322 = 8032235062595420448, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2004025299 and 2004025308.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 89457 + ... + 109592.
It is an arithmetic number, because the mean of its divisors is an integer number (195069000).
Almost surely, 22004025332 is an apocalyptic number.
It is an amenable number.
2004025332 is an abundant number, since it is smaller than the sum of its proper divisors (2677630668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2004025332 is a wasteful number, since it uses less digits than its factorization.
2004025332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 199895 (or 199893 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 21.
The square root of 2004025332 is about 44766.3415078784. The cubic root of 2004025332 is about 1260.7657502015.
Adding to 2004025332 its reverse (2335204002), we get a palindrome (4339229334).
The spelling of 2004025332 in words is "two billion, four million, twenty-five thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •