Base | Representation |
---|---|
bin | 10010110001001110000000… |
… | …100000101101111011011001 |
3 | 101211021102120121001210101222 |
4 | 102301032000200231323121 |
5 | 41304423011411202301 |
6 | 451321343522221425 |
7 | 23246555616252164 |
oct | 2261160040557331 |
9 | 354242517053358 |
10 | 82547132522201 |
11 | 24336051344a06 |
12 | 931222b7b4875 |
13 | 370a2131bc339 |
14 | 165543420aadb |
15 | 9823912c631b |
hex | 4b138082ded9 |
82547132522201 has 2 divisors, whose sum is σ = 82547132522202. Its totient is φ = 82547132522200.
The previous prime is 82547132522171. The next prime is 82547132522203. The reversal of 82547132522201 is 10222523174528.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 46732605015625 + 35814527506576 = 6836125^2 + 5984524^2 .
It is a cyclic number.
It is not a de Polignac number, because 82547132522201 - 210 = 82547132521177 is a prime.
Together with 82547132522203, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (82547132522203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 41273566261100 + 41273566261101.
It is an arithmetic number, because the mean of its divisors is an integer number (41273566261101).
Almost surely, 282547132522201 is an apocalyptic number.
It is an amenable number.
82547132522201 is a deficient number, since it is larger than the sum of its proper divisors (1).
82547132522201 is an equidigital number, since it uses as much as digits as its factorization.
82547132522201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 537600, while the sum is 44.
Adding to 82547132522201 its reverse (10222523174528), we get a palindrome (92769655696729).
The spelling of 82547132522201 in words is "eighty-two trillion, five hundred forty-seven billion, one hundred thirty-two million, five hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •