Base | Representation |
---|---|
bin | 1011001100101111… |
… | …1001100000000000 |
3 | 21202111202212001200 |
4 | 2303023321200000 |
5 | 22124044201033 |
6 | 1214150101200 |
7 | 134332424226 |
oct | 26313714000 |
9 | 7674685050 |
10 | 3006240768 |
11 | 1302a43203 |
12 | 6ba94a800 |
13 | 38ba8acbb |
14 | 20738cb16 |
15 | 128dc8013 |
hex | b32f9800 |
3006240768 has 144 divisors (see below), whose sum is σ = 8886837960. Its totient is φ = 978518016.
The previous prime is 3006240703. The next prime is 3006240791. The reversal of 3006240768 is 8670426003.
It is a tau number, because it is divible by the number of its divisors (144).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 790680 + ... + 794472.
Almost surely, 23006240768 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 3006240768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4443418980).
3006240768 is an abundant number, since it is smaller than the sum of its proper divisors (5880597192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3006240768 is a wasteful number, since it uses less digits than its factorization.
3006240768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3864 (or 3841 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 36.
The square root of 3006240768 is about 54829.1963099953. The cubic root of 3006240768 is about 1443.2489604057.
The spelling of 3006240768 in words is "three billion, six million, two hundred forty thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •