Base | Representation |
---|---|
bin | 1011011110011101… |
… | …1001011010000000 |
3 | 21221200121120102110 |
4 | 2313213121122000 |
5 | 22302110330313 |
6 | 1225403015320 |
7 | 136224212160 |
oct | 26747313200 |
9 | 7850546373 |
10 | 3080558208 |
11 | 1340992a82 |
12 | 71b80a540 |
13 | 3a12aba10 |
14 | 2131b65a0 |
15 | 1306a7ec3 |
hex | b79d9680 |
3080558208 has 256 divisors, whose sum is σ = 10144512000. Its totient is φ = 806547456.
The previous prime is 3080558161. The next prime is 3080558231. The reversal of 3080558208 is 8028550803.
3080558208 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6953635 + ... + 6954077.
It is an arithmetic number, because the mean of its divisors is an integer number (39627000).
Almost surely, 23080558208 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 3080558208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5072256000).
3080558208 is an abundant number, since it is smaller than the sum of its proper divisors (7063953792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3080558208 is a wasteful number, since it uses less digits than its factorization.
3080558208 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 679 (or 667 counting only the distinct ones).
The product of its (nonzero) digits is 76800, while the sum is 39.
The square root of 3080558208 is about 55502.7765791947. The cubic root of 3080558208 is about 1455.0451615037.
The spelling of 3080558208 in words is "three billion, eighty million, five hundred fifty-eight thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •