Base | Representation |
---|---|
bin | 1001100110101101001011… |
… | …00101110000010000010001 |
3 | 2202210011100000201222012021 |
4 | 10303112211211300100101 |
5 | 10232022034334111144 |
6 | 112530525250531441 |
7 | 4306644230426641 |
oct | 463264545602021 |
9 | 82704300658167 |
10 | 21121132332049 |
11 | 6803470635962 |
12 | 2451500596b81 |
13 | ba2939227ba9 |
14 | 5303a8164521 |
15 | 269620bc3884 |
hex | 1335a5970411 |
21121132332049 has 2 divisors, whose sum is σ = 21121132332050. Its totient is φ = 21121132332048.
The previous prime is 21121132331987. The next prime is 21121132332059. The reversal of 21121132332049 is 94023323112112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17713534475025 + 3407597857024 = 4208745^2 + 1845968^2 .
It is a cyclic number.
It is not a de Polignac number, because 21121132332049 - 219 = 21121131807761 is a prime.
It is a super-2 number, since 2×211211323320492 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21121132332059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10560566166024 + 10560566166025.
It is an arithmetic number, because the mean of its divisors is an integer number (10560566166025).
Almost surely, 221121132332049 is an apocalyptic number.
It is an amenable number.
21121132332049 is a deficient number, since it is larger than the sum of its proper divisors (1).
21121132332049 is an equidigital number, since it uses as much as digits as its factorization.
21121132332049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 34.
The spelling of 21121132332049 in words is "twenty-one trillion, one hundred twenty-one billion, one hundred thirty-two million, three hundred thirty-two thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •