Base | Representation |
---|---|
bin | 10111101101111100100110… |
… | …11001101111110111110001 |
3 | 20211200002102111102001220221 |
4 | 23312332103121233313301 |
5 | 23314012010241011021 |
6 | 302532131103133041 |
7 | 13662110523435430 |
oct | 1366762331576761 |
9 | 224602374361827 |
10 | 52156260875761 |
11 | 1568938960a709 |
12 | 5a242962a4181 |
13 | 23144116822c3 |
14 | cc453b165117 |
15 | 606a861d6241 |
hex | 2f6f9366fdf1 |
52156260875761 has 8 divisors (see below), whose sum is σ = 63113458538880. Its totient is φ = 42075639025728.
The previous prime is 52156260875753. The next prime is 52156260875783. The reversal of 52156260875761 is 16757806265125.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 52156260875761 - 23 = 52156260875753 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 52156260875761.
It is not an unprimeable number, because it can be changed into a prime (52156260975761) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 219143953141 + ... + 219143953378.
It is an arithmetic number, because the mean of its divisors is an integer number (7889182317360).
Almost surely, 252156260875761 is an apocalyptic number.
It is an amenable number.
52156260875761 is a deficient number, since it is larger than the sum of its proper divisors (10957197663119).
52156260875761 is a wasteful number, since it uses less digits than its factorization.
52156260875761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 438287906543.
The product of its (nonzero) digits is 42336000, while the sum is 61.
The spelling of 52156260875761 in words is "fifty-two trillion, one hundred fifty-six billion, two hundred sixty million, eight hundred seventy-five thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •