Base | Representation |
---|---|
bin | 1011011110000111… |
… | …0111001010110000 |
3 | 21221120212212002012 |
4 | 2313201313022300 |
5 | 22301222412443 |
6 | 1225311542052 |
7 | 136205660030 |
oct | 26741671260 |
9 | 7846785065 |
10 | 3079107248 |
11 | 1340091938 |
12 | 71b22a928 |
13 | 3a0bc1469 |
14 | 212d198c0 |
15 | 1304bd118 |
hex | b78772b0 |
3079107248 has 80 divisors (see below), whose sum is σ = 7169213760. Its totient is φ = 1253145600.
The previous prime is 3079107233. The next prime is 3079107259. The reversal of 3079107248 is 8427019703.
It is a super-2 number, since 2×30791072482 = 18961802889372267008, which contains 22 as substring.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 190358 + ... + 205898.
It is an arithmetic number, because the mean of its divisors is an integer number (89615172).
Almost surely, 23079107248 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3079107248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3584606880).
3079107248 is an abundant number, since it is smaller than the sum of its proper divisors (4090106512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3079107248 is a wasteful number, since it uses less digits than its factorization.
3079107248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15646 (or 15640 counting only the distinct ones).
The product of its (nonzero) digits is 84672, while the sum is 41.
The square root of 3079107248 is about 55489.7039819100. The cubic root of 3079107248 is about 1454.8166808479.
The spelling of 3079107248 in words is "three billion, seventy-nine million, one hundred seven thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.158 sec. • engine limits •