Base | Representation |
---|---|
bin | 1011001011010111… |
… | …1101100101010000 |
3 | 21202002221200221010 |
4 | 2302311331211100 |
5 | 22121111142240 |
6 | 1213422530520 |
7 | 134232514122 |
oct | 26265754520 |
9 | 7662850833 |
10 | 3000490320 |
11 | 12aa775873 |
12 | 6b8a36a40 |
13 | 38a826779 |
14 | 2066d3212 |
15 | 12863e280 |
hex | b2d7d950 |
3000490320 has 80 divisors (see below), whose sum is σ = 9336045312. Its totient is φ = 797160960.
The previous prime is 3000490309. The next prime is 3000490333. The reversal of 3000490320 is 230940003.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
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, 41974 + ... + 88106.
Almost surely, 23000490320 is an apocalyptic number.
3000490320 is a gapful number since it is divisible by the number (30) 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 3000490320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4668022656).
3000490320 is an abundant number, since it is smaller than the sum of its proper divisors (6335554992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3000490320 is a wasteful number, since it uses less digits than its factorization.
3000490320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46420 (or 46414 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
The square root of 3000490320 is about 54776.7315563826. The cubic root of 3000490320 is about 1442.3281397837.
The spelling of 3000490320 in words is "three billion, four hundred ninety thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •