Base | Representation |
---|---|
bin | 1001100110101100111110… |
… | …00000111010001100010101 |
3 | 2202210011001100011000222101 |
4 | 10303112133000322030111 |
5 | 10232021323113311013 |
6 | 112530510310202101 |
7 | 4306641420624463 |
oct | 463263700721425 |
9 | 82704040130871 |
10 | 21121022010133 |
11 | 6803414334421 |
12 | 245148b653331 |
13 | ba291c40c156 |
14 | 530397647833 |
15 | 2696161808dd |
hex | 13359f03a315 |
21121022010133 has 2 divisors, whose sum is σ = 21121022010134. Its totient is φ = 21121022010132.
The previous prime is 21121022010107. The next prime is 21121022010173. The reversal of 21121022010133 is 33101022012112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15841219890609 + 5279802119524 = 3980103^2 + 2297782^2 .
It is a cyclic number.
It is not a de Polignac number, because 21121022010133 - 213 = 21121022001941 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21121022010133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21121022010173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10560511005066 + 10560511005067.
It is an arithmetic number, because the mean of its divisors is an integer number (10560511005067).
Almost surely, 221121022010133 is an apocalyptic number.
It is an amenable number.
21121022010133 is a deficient number, since it is larger than the sum of its proper divisors (1).
21121022010133 is an equidigital number, since it uses as much as digits as its factorization.
21121022010133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 21121022010133 its reverse (33101022012112), we get a palindrome (54222044022245).
The spelling of 21121022010133 in words is "twenty-one trillion, one hundred twenty-one billion, twenty-two million, ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •