Base | Representation |
---|---|
bin | 1001100110001001110000… |
… | …11111001000011001101101 |
3 | 2202201100021011110120011122 |
4 | 10303010320133020121231 |
5 | 10231214121213311341 |
6 | 112514103033430325 |
7 | 4305402153364100 |
oct | 463047037103155 |
9 | 82640234416148 |
10 | 21102122010221 |
11 | 67a63a581a78a |
12 | 2449895b6b3a5 |
13 | ba0bc98b5255 |
14 | 52d4c34a0737 |
15 | 268dabc9a94b |
hex | 1331387c866d |
21102122010221 has 12 divisors (see below), whose sum is σ = 24963423481440. Its totient is φ = 17780964790680.
The previous prime is 21102122010197. The next prime is 21102122010253. The reversal of 21102122010221 is 12201022120112.
It is not a de Polignac number, because 21102122010221 - 222 = 21102117815917 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21102122010221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21102122010271) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3649620425 + ... + 3649626206.
It is an arithmetic number, because the mean of its divisors is an integer number (2080285290120).
Almost surely, 221102122010221 is an apocalyptic number.
It is an amenable number.
21102122010221 is a deficient number, since it is larger than the sum of its proper divisors (3861301471219).
21102122010221 is an equidigital number, since it uses as much as digits as its factorization.
21102122010221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7299246704 (or 7299246697 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 21102122010221 its reverse (12201022120112), we get a palindrome (33303144130333).
The spelling of 21102122010221 in words is "twenty-one trillion, one hundred two billion, one hundred twenty-two million, ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •