Base | Representation |
---|---|
bin | 1001111000111110… |
… | …11011100110001000 |
3 | 111201001101210210120 |
4 | 10330133123212020 |
5 | 41333304333002 |
6 | 2234520143240 |
7 | 245403615240 |
oct | 47437334610 |
9 | 14631353716 |
10 | 5309839752 |
11 | 22852a2218 |
12 | 1042307b20 |
13 | 6680c3319 |
14 | 3852b6b20 |
15 | 21125acbc |
hex | 13c7db988 |
5309839752 has 128 divisors (see below), whose sum is σ = 15429120000. Its totient is φ = 1491499008.
The previous prime is 5309839747. The next prime is 5309839753. The reversal of 5309839752 is 2579389035.
It is a junction number, because it is equal to n+sod(n) for n = 5309839695 and 5309839704.
It is not an unprimeable number, because it can be changed into a prime (5309839753) 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, 2655249 + ... + 2657247.
It is an arithmetic number, because the mean of its divisors is an integer number (120540000).
Almost surely, 25309839752 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 5309839752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7714560000).
5309839752 is an abundant number, since it is smaller than the sum of its proper divisors (10119280248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5309839752 is a wasteful number, since it uses less digits than its factorization.
5309839752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2275 (or 2271 counting only the distinct ones).
The product of its (nonzero) digits is 2041200, while the sum is 51.
The square root of 5309839752 is about 72868.6472496917. The cubic root of 5309839752 is about 1744.5917115510.
The spelling of 5309839752 in words is "five billion, three hundred nine million, eight hundred thirty-nine thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •