Base | Representation |
---|---|
bin | 1001100110001000000101… |
… | …10110001111110001010101 |
3 | 2202201020221110010101111102 |
4 | 10303010002312033301111 |
5 | 10231210300324200203 |
6 | 112513433445315445 |
7 | 4305340645311224 |
oct | 463040266176125 |
9 | 82636843111442 |
10 | 21101222100053 |
11 | 67a5a83849977 |
12 | 2449684705b85 |
13 | ba0ab5320724 |
14 | 52d439b68cbb |
15 | 268d57c8a888 |
hex | 133102d8fc55 |
21101222100053 has 2 divisors, whose sum is σ = 21101222100054. Its totient is φ = 21101222100052.
The previous prime is 21101222100047. The next prime is 21101222100089. The reversal of 21101222100053 is 35000122210112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13821791466289 + 7279430633764 = 3717767^2 + 2698042^2 .
It is a cyclic number.
It is not a de Polignac number, because 21101222100053 - 218 = 21101221837909 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21101222099998 and 21101222100034.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21101222106053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10550611050026 + 10550611050027.
It is an arithmetic number, because the mean of its divisors is an integer number (10550611050027).
Almost surely, 221101222100053 is an apocalyptic number.
It is an amenable number.
21101222100053 is a deficient number, since it is larger than the sum of its proper divisors (1).
21101222100053 is an equidigital number, since it uses as much as digits as its factorization.
21101222100053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 21101222100053 its reverse (35000122210112), we get a palindrome (56101344310165).
The spelling of 21101222100053 in words is "twenty-one trillion, one hundred one billion, two hundred twenty-two million, one hundred thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •