Base | Representation |
---|---|
bin | 1100010100100110… |
… | …0101111001000000 |
3 | 22112111212210221110 |
4 | 3011021211321000 |
5 | 23233223013143 |
6 | 1304113523320 |
7 | 144652233426 |
oct | 30511457100 |
9 | 8474783843 |
10 | 3307626048 |
11 | 1448083451 |
12 | 783873540 |
13 | 40935249c |
14 | 235403116 |
15 | 1455ac533 |
hex | c5265e40 |
3307626048 has 112 divisors (see below), whose sum is σ = 9012326400. Its totient is φ = 1070006784.
The previous prime is 3307626017. The next prime is 3307626053. The reversal of 3307626048 is 8406267033.
It is a junction number, because it is equal to n+sod(n) for n = 3307625997 and 3307626015.
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, 1377553 + ... + 1379951.
It is an arithmetic number, because the mean of its divisors is an integer number (80467200).
Almost surely, 23307626048 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 3307626048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4506163200).
3307626048 is an abundant number, since it is smaller than the sum of its proper divisors (5704700352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3307626048 is a wasteful number, since it uses less digits than its factorization.
3307626048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2624 (or 2614 counting only the distinct ones).
The product of its (nonzero) digits is 145152, while the sum is 39.
The square root of 3307626048 is about 57511.9643900293. The cubic root of 3307626048 is about 1489.9515093148.
The spelling of 3307626048 in words is "three billion, three hundred seven million, six hundred twenty-six thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •