Base | Representation |
---|---|
bin | 1001010101101011… |
… | …11100001100100100 |
3 | 110221102020220210100 |
4 | 10222311330030210 |
5 | 40232010004224 |
6 | 2145302024100 |
7 | 235150114404 |
oct | 45265741444 |
9 | 13842226710 |
10 | 5013750564 |
11 | 214314a009 |
12 | b7b118030 |
13 | 61b964614 |
14 | 357c40804 |
15 | 1e5270ac9 |
hex | 12ad7c324 |
5013750564 has 72 divisors (see below), whose sum is σ = 13162738680. Its totient is φ = 1607772672.
The previous prime is 5013750529. The next prime is 5013750607. The reversal of 5013750564 is 4650573105.
It can be written as a sum of positive squares in 4 ways, for example, as 503553600 + 4510196964 = 22440^2 + 67158^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 97402 + ... + 139694.
It is an arithmetic number, because the mean of its divisors is an integer number (182815815).
Almost surely, 25013750564 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 5013750564, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6581369340).
5013750564 is an abundant number, since it is smaller than the sum of its proper divisors (8148988116).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5013750564 is a wasteful number, since it uses less digits than its factorization.
5013750564 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42429 (or 42424 counting only the distinct ones).
The product of its (nonzero) digits is 63000, while the sum is 36.
The square root of 5013750564 is about 70807.8425317422. The cubic root of 5013750564 is about 1711.5420541417.
The spelling of 5013750564 in words is "five billion, thirteen million, seven hundred fifty thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •