Base | Representation |
---|---|
bin | 1000011001110110… |
… | …00100110011010100 |
3 | 102122102201011200220 |
4 | 10030323010303110 |
5 | 33220003430202 |
6 | 2023411034340 |
7 | 216543332463 |
oct | 41473046324 |
9 | 12572634626 |
10 | 4511780052 |
11 | 1a0586714a |
12 | a5ab9b9b0 |
13 | 56b96c650 |
14 | 30b2d49da |
15 | 1b6168abc |
hex | 10cec4cd4 |
4511780052 has 96 divisors (see below), whose sum is σ = 12319211520. Its totient is φ = 1272723840.
The previous prime is 4511780017. The next prime is 4511780057. The reversal of 4511780052 is 2500871154.
It is a junction number, because it is equal to n+sod(n) for n = 4511779995 and 4511780022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4511780057) 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, 67333 + ... + 116435.
It is an arithmetic number, because the mean of its divisors is an integer number (128325120).
Almost surely, 24511780052 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 4511780052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6159605760).
4511780052 is an abundant number, since it is smaller than the sum of its proper divisors (7807431468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4511780052 is a wasteful number, since it uses less digits than its factorization.
4511780052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49173 (or 49171 counting only the distinct ones).
The product of its (nonzero) digits is 11200, while the sum is 33.
The square root of 4511780052 is about 67169.7852609341. The cubic root of 4511780052 is about 1652.4029941767.
The spelling of 4511780052 in words is "four billion, five hundred eleven million, seven hundred eighty thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •