Base | Representation |
---|---|
bin | 1011010000010000… |
… | …0111010111001000 |
3 | 21210112111120012120 |
4 | 2310010013113020 |
5 | 22141332240413 |
6 | 1215434011240 |
7 | 134601612615 |
oct | 26404072710 |
9 | 7715446176 |
10 | 3020977608 |
11 | 1310299210 |
12 | 703876b20 |
13 | 391b4a91c |
14 | 20930750c |
15 | 12a339723 |
hex | b41075c8 |
3020977608 has 64 divisors (see below), whose sum is σ = 8280576000. Its totient is φ = 910831680.
The previous prime is 3020977579. The next prime is 3020977627. The reversal of 3020977608 is 8067790203.
It is a self number, because there is not a number n which added to its sum of digits gives 3020977608.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23785 + ... + 81287.
It is an arithmetic number, because the mean of its divisors is an integer number (129384000).
Almost surely, 23020977608 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 3020977608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4140288000).
3020977608 is an abundant number, since it is smaller than the sum of its proper divisors (5259598392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3020977608 is a wasteful number, since it uses less digits than its factorization.
3020977608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57722 (or 57718 counting only the distinct ones).
The product of its (nonzero) digits is 127008, while the sum is 42.
The square root of 3020977608 is about 54963.4206359102. The cubic root of 3020977608 is about 1445.6034257745.
The spelling of 3020977608 in words is "three billion, twenty million, nine hundred seventy-seven thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •