Base | Representation |
---|---|
bin | 100101100001101110000… |
… | …0000111111001100011000 |
3 | 200021001210122011121001221 |
4 | 1023003130000333030120 |
5 | 1134000332403022220 |
6 | 14545220450021424 |
7 | 1041425265443632 |
oct | 113033400771430 |
9 | 20231718147057 |
10 | 5157652001560 |
11 | 1709391105743 |
12 | 6b3707277874 |
13 | 2b5497a516a6 |
14 | 13b8bb4d5a52 |
15 | 8e267eaa9aa |
hex | 4b0dc03f318 |
5157652001560 has 32 divisors (see below), whose sum is σ = 11605989296160. Its totient is φ = 2062834615296.
The previous prime is 5157652001479. The next prime is 5157652001569. The reversal of 5157652001560 is 651002567515.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5157652001569) 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 7 ways as a sum of consecutive naturals, for example, 6698649 + ... + 7428808.
It is an arithmetic number, because the mean of its divisors is an integer number (362687165505).
Almost surely, 25157652001560 is an apocalyptic number.
It is an amenable number.
5157652001560 is an abundant number, since it is smaller than the sum of its proper divisors (6448337294600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5157652001560 is a wasteful number, since it uses less digits than its factorization.
5157652001560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14136595 (or 14136591 counting only the distinct ones).
The product of its (nonzero) digits is 315000, while the sum is 43.
The spelling of 5157652001560 in words is "five trillion, one hundred fifty-seven billion, six hundred fifty-two million, one thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •