Base | Representation |
---|---|
bin | 1001100110101100111011… |
… | …10101001000000100111101 |
3 | 2202210010222221202201211221 |
4 | 10303112131311020010331 |
5 | 10232021303022102221 |
6 | 112530504320313341 |
7 | 4306641060024061 |
oct | 463263565100475 |
9 | 82703887681757 |
10 | 21121002144061 |
11 | 68034040a5786 |
12 | 2451484a72851 |
13 | ba2918274991 |
14 | 530394b55aa1 |
15 | 269614559541 |
hex | 13359dd4813d |
21121002144061 has 2 divisors, whose sum is σ = 21121002144062. Its totient is φ = 21121002144060.
The previous prime is 21121002144049. The next prime is 21121002144071. The reversal of 21121002144061 is 16044120012112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17103807705625 + 4017194438436 = 4135675^2 + 2004294^2 .
It is a cyclic number.
It is not a de Polignac number, because 21121002144061 - 237 = 20983563190589 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21121002144071) 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, 10560501072030 + 10560501072031.
It is an arithmetic number, because the mean of its divisors is an integer number (10560501072031).
Almost surely, 221121002144061 is an apocalyptic number.
It is an amenable number.
21121002144061 is a deficient number, since it is larger than the sum of its proper divisors (1).
21121002144061 is an equidigital number, since it uses as much as digits as its factorization.
21121002144061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 21121002144061 its reverse (16044120012112), we get a palindrome (37165122156173).
The spelling of 21121002144061 in words is "twenty-one trillion, one hundred twenty-one billion, two million, one hundred forty-four thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •