Base | Representation |
---|---|
bin | 1001100001110000… |
… | …11010000101010000 |
3 | 111012110212222222102 |
4 | 10300320122011100 |
5 | 40433423414220 |
6 | 2203321255532 |
7 | 240520204001 |
oct | 46070320520 |
9 | 14173788872 |
10 | 5115060560 |
11 | 2195355785 |
12 | ba90345a8 |
13 | 63694646c |
14 | 3674931a8 |
15 | 1ee0d3775 |
hex | 130e1a150 |
5115060560 has 40 divisors (see below), whose sum is σ = 12213942216. Its totient is φ = 1990725120.
The previous prime is 5115060557. The next prime is 5115060563. The reversal of 5115060560 is 650605115.
It is an interprime number because it is at equal distance from previous prime (5115060557) and next prime (5115060563).
It can be written as a sum of positive squares in 4 ways, for example, as 802248976 + 4312811584 = 28324^2 + 65672^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5115060563) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 861071 + ... + 866990.
Almost surely, 25115060560 is an apocalyptic number.
It is an amenable number.
5115060560 is an abundant number, since it is smaller than the sum of its proper divisors (7098881656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5115060560 is a wasteful number, since it uses less digits than its factorization.
5115060560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1728111 (or 1728105 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 29.
The square root of 5115060560 is about 71519.6515651468. The cubic root of 5115060560 is about 1722.9933184391.
Adding to 5115060560 its reverse (650605115), we get a palindrome (5765665675).
The spelling of 5115060560 in words is "five billion, one hundred fifteen million, sixty thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •