Base | Representation |
---|---|
bin | 10110000101011101101011… |
… | …11011111100011001100101 |
3 | 20100221212222022002012020012 |
4 | 23002232311323330121211 |
5 | 22331202133341341421 |
6 | 251143005351420005 |
7 | 13141536614226446 |
oct | 1302566573743145 |
9 | 210855868065205 |
10 | 48566247605861 |
11 | 14524914721597 |
12 | 554456a084605 |
13 | 2113a1521736b |
14 | bdc8944952cd |
15 | 5934bd76095b |
hex | 2c2bb5efc665 |
48566247605861 has 2 divisors, whose sum is σ = 48566247605862. Its totient is φ = 48566247605860.
The previous prime is 48566247605801. The next prime is 48566247605867. The reversal of 48566247605861 is 16850674266584.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 44011203200836 + 4555044405025 = 6634094^2 + 2134255^2 .
It is a cyclic number.
It is not a de Polignac number, because 48566247605861 - 218 = 48566247343717 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 48566247605791 and 48566247605800.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (48566247605867) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24283123802930 + 24283123802931.
It is an arithmetic number, because the mean of its divisors is an integer number (24283123802931).
Almost surely, 248566247605861 is an apocalyptic number.
It is an amenable number.
48566247605861 is a deficient number, since it is larger than the sum of its proper divisors (1).
48566247605861 is an equidigital number, since it uses as much as digits as its factorization.
48566247605861 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 464486400, while the sum is 68.
The spelling of 48566247605861 in words is "forty-eight trillion, five hundred sixty-six billion, two hundred forty-seven million, six hundred five thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •