Base | Representation |
---|---|
bin | 1001001100101010… |
… | …01011000110110100 |
3 | 110202010211000220120 |
4 | 10212111023012310 |
5 | 40103120131040 |
6 | 2133555331540 |
7 | 233240515056 |
oct | 44625130664 |
9 | 13663730816 |
10 | 4938052020 |
11 | 2104446630 |
12 | b598b0bb0 |
13 | 60907c095 |
14 | 34bb778d6 |
15 | 1dd7bb7d0 |
hex | 12654b1b4 |
4938052020 has 96 divisors (see below), whose sum is σ = 15133257216. Its totient is φ = 1193155200.
The previous prime is 4938051983. The next prime is 4938052027. The reversal of 4938052020 is 202508394.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4938052027) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 190435 + ... + 214805.
It is an arithmetic number, because the mean of its divisors is an integer number (157638096).
Almost surely, 24938052020 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 4938052020, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7566628608).
4938052020 is an abundant number, since it is smaller than the sum of its proper divisors (10195205196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4938052020 is a wasteful number, since it uses less digits than its factorization.
4938052020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24701 (or 24699 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 33.
The square root of 4938052020 is about 70271.2745010363. The cubic root of 4938052020 is about 1702.8846088879.
The spelling of 4938052020 in words is "four billion, nine hundred thirty-eight million, fifty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •