Base | Representation |
---|---|
bin | 1001011110111001011001… |
… | …01100110011000011100001 |
3 | 2201211111202121112022201002 |
4 | 10233130230230303003201 |
5 | 10213123031414204131 |
6 | 112203352420121345 |
7 | 4251365136553352 |
oct | 457345454630341 |
9 | 81744677468632 |
10 | 20852816163041 |
11 | 670a6a2101855 |
12 | 24094b9b36255 |
13 | b83548599195 |
14 | 5213d2d43d29 |
15 | 262669d9b6cb |
hex | 12f72cb330e1 |
20852816163041 has 2 divisors, whose sum is σ = 20852816163042. Its totient is φ = 20852816163040.
The previous prime is 20852816163037. The next prime is 20852816163119. The reversal of 20852816163041 is 14036161825802.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20790827612416 + 61988550625 = 4559696^2 + 248975^2 .
It is a cyclic number.
It is not a de Polignac number, because 20852816163041 - 22 = 20852816163037 is a prime.
It is not a weakly prime, because it can be changed into another prime (20852816183041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10426408081520 + 10426408081521.
It is an arithmetic number, because the mean of its divisors is an integer number (10426408081521).
Almost surely, 220852816163041 is an apocalyptic number.
It is an amenable number.
20852816163041 is a deficient number, since it is larger than the sum of its proper divisors (1).
20852816163041 is an equidigital number, since it uses as much as digits as its factorization.
20852816163041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 552960, while the sum is 47.
Adding to 20852816163041 its reverse (14036161825802), we get a palindrome (34888977988843).
The spelling of 20852816163041 in words is "twenty trillion, eight hundred fifty-two billion, eight hundred sixteen million, one hundred sixty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •