Base | Representation |
---|---|
bin | 1001010101111000010111… |
… | …00101011011001100110001 |
3 | 2200201220010120220212012222 |
4 | 10222330023211123030301 |
5 | 10143034102332440011 |
6 | 111405200124130425 |
7 | 4220120154565154 |
oct | 452741345331461 |
9 | 80656116825188 |
10 | 20543022936881 |
11 | 660027998a815 |
12 | 2379460996a15 |
13 | b602778696c3 |
14 | 510405305c9b |
15 | 259587a75ddb |
hex | 12af0b95b331 |
20543022936881 has 2 divisors, whose sum is σ = 20543022936882. Its totient is φ = 20543022936880.
The previous prime is 20543022936809. The next prime is 20543022936977. The reversal of 20543022936881 is 18863922034502.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20531628441856 + 11394495025 = 4531184^2 + 106745^2 .
It is a cyclic number.
It is not a de Polignac number, because 20543022936881 - 210 = 20543022935857 is a prime.
It is a super-2 number, since 2×205430229368812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20543022936281) 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, 10271511468440 + 10271511468441.
It is an arithmetic number, because the mean of its divisors is an integer number (10271511468441).
Almost surely, 220543022936881 is an apocalyptic number.
It is an amenable number.
20543022936881 is a deficient number, since it is larger than the sum of its proper divisors (1).
20543022936881 is an equidigital number, since it uses as much as digits as its factorization.
20543022936881 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4976640, while the sum is 53.
The spelling of 20543022936881 in words is "twenty trillion, five hundred forty-three billion, twenty-two million, nine hundred thirty-six thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •