Base | Representation |
---|---|
bin | 1001100001111011… |
… | …01101111011010100 |
3 | 111012120111201110010 |
4 | 10300331231323110 |
5 | 40434302440224 |
6 | 2203411200220 |
7 | 240535062216 |
oct | 46075557324 |
9 | 14176451403 |
10 | 5116452564 |
11 | 21961165a3 |
12 | ba95a6070 |
13 | 637012c32 |
14 | 3677365b6 |
15 | 1ee2aae29 |
hex | 130f6ded4 |
5116452564 has 12 divisors (see below), whose sum is σ = 11938389344. Its totient is φ = 1705484184.
The previous prime is 5116452527. The next prime is 5116452569. The reversal of 5116452564 is 4652546115.
It is a tau number, because it is divible by the number of its divisors (12).
It is a hoax number, since the sum of its digits (39) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5116452569) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 213185512 + ... + 213185535.
Almost surely, 25116452564 is an apocalyptic number.
It is an amenable number.
5116452564 is an abundant number, since it is smaller than the sum of its proper divisors (6821936780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5116452564 is a wasteful number, since it uses less digits than its factorization.
5116452564 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 426371054 (or 426371052 counting only the distinct ones).
The product of its digits is 144000, while the sum is 39.
The square root of 5116452564 is about 71529.3825221496. The cubic root of 5116452564 is about 1723.1496017668.
Adding to 5116452564 its reverse (4652546115), we get a palindrome (9768998679).
The spelling of 5116452564 in words is "five billion, one hundred sixteen million, four hundred fifty-two thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •