Base | Representation |
---|---|
bin | 1001100110101110110010… |
… | …11011010110011100001101 |
3 | 2202210020120122012200221011 |
4 | 10303113121123112130031 |
5 | 10232030330004120414 |
6 | 112531151435205221 |
7 | 4310004620600434 |
oct | 463273133263415 |
9 | 82706518180834 |
10 | 21122002020109 |
11 | 6803877544421 |
12 | 24517038a6811 |
13 | ba2a4746a603 |
14 | 53044b87011b |
15 | 269672213dc4 |
hex | 1335d96d670d |
21122002020109 has 2 divisors, whose sum is σ = 21122002020110. Its totient is φ = 21122002020108.
The previous prime is 21122002020089. The next prime is 21122002020191. The reversal of 21122002020109 is 90102020022112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19235285498025 + 1886716522084 = 4385805^2 + 1373578^2 .
It is a cyclic number.
It is not a de Polignac number, because 21122002020109 - 29 = 21122002019597 is a prime.
It is a super-2 number, since 2×211220020201092 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21122002020109.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21122002020209) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10561001010054 + 10561001010055.
It is an arithmetic number, because the mean of its divisors is an integer number (10561001010055).
Almost surely, 221122002020109 is an apocalyptic number.
It is an amenable number.
21122002020109 is a deficient number, since it is larger than the sum of its proper divisors (1).
21122002020109 is an equidigital number, since it uses as much as digits as its factorization.
21122002020109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 22.
The spelling of 21122002020109 in words is "twenty-one trillion, one hundred twenty-two billion, two million, twenty thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •