Base | Representation |
---|---|
bin | 1001010111101100… |
… | …10001110000000000 |
3 | 110222120222202220111 |
4 | 10223312101300000 |
5 | 40300314203224 |
6 | 2151103321104 |
7 | 235443350065 |
oct | 45366216000 |
9 | 13876882814 |
10 | 5030616064 |
11 | 2151719341 |
12 | b848b0194 |
13 | 6222bb0c6 |
14 | 35a190c6c |
15 | 1e69a2d94 |
hex | 12bd91c00 |
5030616064 has 132 divisors (see below), whose sum is σ = 10859253120. Its totient is φ = 2328494080.
The previous prime is 5030616011. The next prime is 5030616067. The reversal of 5030616064 is 4606160305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5030616067) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 26338209 + ... + 26338399.
Almost surely, 25030616064 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 5030616064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5429626560).
5030616064 is an abundant number, since it is smaller than the sum of its proper divisors (5828637056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5030616064 is a wasteful number, since it uses less digits than its factorization.
5030616064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334 (or 299 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 31.
The square root of 5030616064 is about 70926.8359931557. The cubic root of 5030616064 is about 1713.4590293036.
Adding to 5030616064 its reverse (4606160305), we get a palindrome (9636776369).
The spelling of 5030616064 in words is "five billion, thirty million, six hundred sixteen thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.198 sec. • engine limits •