Base | Representation |
---|---|
bin | 101100000001111011011… |
… | …100010101000000000000 |
3 | 101201020221012001002112000 |
4 | 230001323130111000000 |
5 | 344033142332000000 |
6 | 10234000015504000 |
7 | 431413234435326 |
oct | 54017334250000 |
9 | 11636835032460 |
10 | 3025728000000 |
11 | a672276369a2 |
12 | 40a4a6228000 |
13 | 18c42bb2a344 |
14 | a6635c25d16 |
15 | 53a8d2ba000 |
hex | 2c07b715000 |
3025728000000 has 1456 divisors, whose sum is σ = 11979184164480. Its totient is φ = 752025600000.
The previous prime is 3025727999989. The next prime is 3025728000007. The reversal of 3025728000000 is 8275203.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3025728000007) by changing a digit.
It is a polite number, since it can be written in 111 ways as a sum of consecutive naturals, for example, 29375999949 + ... + 29376000051.
Almost surely, 23025728000000 is an apocalyptic number.
3025728000000 is a gapful number since it is divisible by the number (30) 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 3025728000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5989592082240).
3025728000000 is an abundant number, since it is smaller than the sum of its proper divisors (8953456164480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3025728000000 is an frugal number, since it uses more digits than its factorization.
3025728000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183 (or 130 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The spelling of 3025728000000 in words is "three trillion, twenty-five billion, seven hundred twenty-eight million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •