Base | Representation |
---|---|
bin | 1001100011001101101000… |
… | …10011000111111000100101 |
3 | 2202100200120011101221120001 |
4 | 10301212310103013320211 |
5 | 10223040243211201203 |
6 | 112355440434341301 |
7 | 4265165221554223 |
oct | 461466423077045 |
9 | 82320504357501 |
10 | 21001120022053 |
11 | 6767585833096 |
12 | 24321a872a831 |
13 | b94521620702 |
14 | 528661335b13 |
15 | 266449ada91d |
hex | 1319b44c7e25 |
21001120022053 has 2 divisors, whose sum is σ = 21001120022054. Its totient is φ = 21001120022052.
The previous prime is 21001120022009. The next prime is 21001120022093. The reversal of 21001120022053 is 35022002110012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20571286371364 + 429833650689 = 4535558^2 + 655617^2 .
It is a cyclic number.
It is not a de Polignac number, because 21001120022053 - 217 = 21001119890981 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21001120022053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21001120022093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10500560011026 + 10500560011027.
It is an arithmetic number, because the mean of its divisors is an integer number (10500560011027).
Almost surely, 221001120022053 is an apocalyptic number.
It is an amenable number.
21001120022053 is a deficient number, since it is larger than the sum of its proper divisors (1).
21001120022053 is an equidigital number, since it uses as much as digits as its factorization.
21001120022053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 240, while the sum is 19.
Adding to 21001120022053 its reverse (35022002110012), we get a palindrome (56023122132065).
The spelling of 21001120022053 in words is "twenty-one trillion, one billion, one hundred twenty million, twenty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •