Base | Representation |
---|---|
bin | 1001100110001001110000… |
… | …10111100011000011000101 |
3 | 2202201100021000201120010201 |
4 | 10303010320113203003011 |
5 | 10231214120211202323 |
6 | 112514102523050501 |
7 | 4305402130444126 |
oct | 463047027430305 |
9 | 82640230646121 |
10 | 21102120022213 |
11 | 67a63a46920aa |
12 | 2449895370a31 |
13 | ba0bc936a409 |
14 | 52d4c310404d |
15 | 268daba068ad |
hex | 1331385e30c5 |
21102120022213 has 2 divisors, whose sum is σ = 21102120022214. Its totient is φ = 21102120022212.
The previous prime is 21102120022187. The next prime is 21102120022229. The reversal of 21102120022213 is 31222002120112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20312264789569 + 789855232644 = 4506913^2 + 888738^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21102120022213 is a prime.
It is a super-2 number, since 2×211021200222132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21102120022283) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10551060011106 + 10551060011107.
It is an arithmetic number, because the mean of its divisors is an integer number (10551060011107).
Almost surely, 221102120022213 is an apocalyptic number.
It is an amenable number.
21102120022213 is a deficient number, since it is larger than the sum of its proper divisors (1).
21102120022213 is an equidigital number, since it uses as much as digits as its factorization.
21102120022213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 21102120022213 its reverse (31222002120112), we get a palindrome (52324122142325).
The spelling of 21102120022213 in words is "twenty-one trillion, one hundred two billion, one hundred twenty million, twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •