Base | Representation |
---|---|
bin | 111011101111101… |
… | …1011101101111100 |
3 | 12011201020202210010 |
4 | 1313133123231330 |
5 | 13101202304300 |
6 | 530532143220 |
7 | 100451625042 |
oct | 16737335574 |
9 | 5151222703 |
10 | 2004728700 |
11 | 939687387 |
12 | 47b467b10 |
13 | 25c441800 |
14 | 15036a392 |
15 | baee8a50 |
hex | 777dbb7c |
2004728700 has 108 divisors (see below), whose sum is σ = 6281009448. Its totient is φ = 493459200.
The previous prime is 2004728653. The next prime is 2004728729. The reversal of 2004728700 is 78274002.
It is a Harshad number since it is a multiple of its sum of digits (30).
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 35 ways as a sum of consecutive naturals, for example, 30930 + ... + 70470.
Almost surely, 22004728700 is an apocalyptic number.
2004728700 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2004728700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3140504724).
2004728700 is an abundant number, since it is smaller than the sum of its proper divisors (4276280748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2004728700 is a wasteful number, since it uses less digits than its factorization.
2004728700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39584 (or 39564 counting only the distinct ones).
The product of its (nonzero) digits is 6272, while the sum is 30.
The square root of 2004728700 is about 44774.1968102165. The cubic root of 2004728700 is about 1260.9132331272.
The spelling of 2004728700 in words is "two billion, four million, seven hundred twenty-eight thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •