Base | Representation |
---|---|
bin | 1011011110111011… |
… | …0011101000000000 |
3 | 21221211021020220012 |
4 | 2313232303220000 |
5 | 22303110004413 |
6 | 1225512404052 |
7 | 136246552145 |
oct | 26756635000 |
9 | 7854236805 |
10 | 3082500608 |
11 | 1341a9a370 |
12 | 7203a6628 |
13 | 3a180bb75 |
14 | 2135603cc |
15 | 13093d7a8 |
hex | b7bb3a00 |
3082500608 has 80 divisors (see below), whose sum is σ = 6786663840. Its totient is φ = 1387008000.
The previous prime is 3082500569. The next prime is 3082500653. The reversal of 3082500608 is 8060052803.
3082500608 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 (32).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 566123 + ... + 571541.
It is an arithmetic number, because the mean of its divisors is an integer number (84833298).
Almost surely, 23082500608 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 3082500608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3393331920).
3082500608 is an abundant number, since it is smaller than the sum of its proper divisors (3704163232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3082500608 is a wasteful number, since it uses less digits than its factorization.
3082500608 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5549 (or 5533 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 32.
The square root of 3082500608 is about 55520.2720454430. The cubic root of 3082500608 is about 1455.3509162529.
The spelling of 3082500608 in words is "three billion, eighty-two million, five hundred thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •