Base | Representation |
---|---|
bin | 100101001110101000111… |
… | …1011010001100001110101 |
3 | 200010011001021010211000210 |
4 | 1022131101323101201311 |
5 | 1132312430204323300 |
6 | 14514323125300033 |
7 | 1035445054002312 |
oct | 112352173214165 |
9 | 20104037124023 |
10 | 5116680542325 |
11 | 16a2a76857a30 |
12 | 6a7791b64619 |
13 | 2b16686459a1 |
14 | 139911cc9d09 |
15 | 8d16b07e050 |
hex | 4a751ed1875 |
5116680542325 has 48 divisors (see below), whose sum is σ = 9228875832000. Its totient is φ = 2480749017600.
The previous prime is 5116680542317. The next prime is 5116680542329. The reversal of 5116680542325 is 5232450866115.
It is not a de Polignac number, because 5116680542325 - 23 = 5116680542317 is a prime.
It is a super-3 number, since 3×51166805423253 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5116680542329) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 48249961 + ... + 48355889.
It is an arithmetic number, because the mean of its divisors is an integer number (192268246500).
Almost surely, 25116680542325 is an apocalyptic number.
5116680542325 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5116680542325 is a deficient number, since it is larger than the sum of its proper divisors (4112195289675).
5116680542325 is a wasteful number, since it uses less digits than its factorization.
5116680542325 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 164502 (or 164497 counting only the distinct ones).
The product of its (nonzero) digits is 1728000, while the sum is 48.
The spelling of 5116680542325 in words is "five trillion, one hundred sixteen billion, six hundred eighty million, five hundred forty-two thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •