Base | Representation |
---|---|
bin | 1111000101000111… |
… | …1110110001011000 |
3 | 101110010001212002120 |
4 | 3301101332301120 |
5 | 31242243210431 |
6 | 1505403101240 |
7 | 202212424131 |
oct | 36121766130 |
9 | 11403055076 |
10 | 4048022616 |
11 | 1798004340 |
12 | 94b811820 |
13 | 4c6866a71 |
14 | 2a5894c88 |
15 | 18a5ae196 |
hex | f147ec58 |
4048022616 has 128 divisors (see below), whose sum is σ = 11296834560. Its totient is φ = 1198454400.
The previous prime is 4048022603. The next prime is 4048022621. The reversal of 4048022616 is 6162208404.
It is a Harshad number since it is a multiple of its sum of digits (33).
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 31 ways as a sum of consecutive naturals, for example, 2316255 + ... + 2318001.
It is an arithmetic number, because the mean of its divisors is an integer number (88256520).
Almost surely, 24048022616 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 4048022616, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5648417280).
4048022616 is an abundant number, since it is smaller than the sum of its proper divisors (7248811944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4048022616 is a wasteful number, since it uses less digits than its factorization.
4048022616 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1965 (or 1961 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 33.
The square root of 4048022616 is about 63624.0726140664. The cubic root of 4048022616 is about 1593.7283937586.
The spelling of 4048022616 in words is "four billion, forty-eight million, twenty-two thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •