Base | Representation |
---|---|
bin | 1011010001010001… |
… | …1001101000001000 |
3 | 21210211112110100010 |
4 | 2310110121220020 |
5 | 22143430343403 |
6 | 1220105311520 |
7 | 134653113210 |
oct | 26424315010 |
9 | 7724473303 |
10 | 3025246728 |
11 | 1312744709 |
12 | 7051955a0 |
13 | 3929b3b2a |
14 | 209ad9240 |
15 | 12a8ce603 |
hex | b4519a08 |
3025246728 has 128 divisors (see below), whose sum is σ = 9223833600. Its totient is φ = 807584256.
The previous prime is 3025246727. The next prime is 3025246751. The reversal of 3025246728 is 8276425203.
It is not an unprimeable number, because it can be changed into a prime (3025246727) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 226525 + ... + 239507.
It is an arithmetic number, because the mean of its divisors is an integer number (72061200).
Almost surely, 23025246728 is an apocalyptic number.
3025246728 is a gapful number since it is divisible by the number (38) 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 3025246728, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4611916800).
3025246728 is an abundant number, since it is smaller than the sum of its proper divisors (6198586872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3025246728 is a wasteful number, since it uses less digits than its factorization.
3025246728 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13091 (or 13087 counting only the distinct ones).
The product of its (nonzero) digits is 161280, while the sum is 39.
The square root of 3025246728 is about 55002.2429360840. The cubic root of 3025246728 is about 1446.2840608202.
The spelling of 3025246728 in words is "three billion, twenty-five million, two hundred forty-six thousand, seven hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •