Base | Representation |
---|---|
bin | 1001100011110100110000… |
… | …00000000100100001111101 |
3 | 2202102200202200202112121022 |
4 | 10301322120000010201331 |
5 | 10223411300221231023 |
6 | 112413232331113525 |
7 | 4266540506364152 |
oct | 461723000044175 |
9 | 82380680675538 |
10 | 21022120102013 |
11 | 677548182aa78 |
12 | 24362895a28a5 |
13 | b964ba262a24 |
14 | 52969438a229 |
15 | 266c785517c8 |
hex | 131e9800487d |
21022120102013 has 2 divisors, whose sum is σ = 21022120102014. Its totient is φ = 21022120102012.
The previous prime is 21022120101971. The next prime is 21022120102051. The reversal of 21022120102013 is 31020102122012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18605531708569 + 2416588393444 = 4313413^2 + 1554538^2 .
It is a cyclic number.
It is not a de Polignac number, because 21022120102013 - 230 = 21021046360189 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21022120101982 and 21022120102000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21022120102513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10511060051006 + 10511060051007.
It is an arithmetic number, because the mean of its divisors is an integer number (10511060051007).
Almost surely, 221022120102013 is an apocalyptic number.
It is an amenable number.
21022120102013 is a deficient number, since it is larger than the sum of its proper divisors (1).
21022120102013 is an equidigital number, since it uses as much as digits as its factorization.
21022120102013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 21022120102013 its reverse (31020102122012), we get a palindrome (52042222224025).
The spelling of 21022120102013 in words is "twenty-one trillion, twenty-two billion, one hundred twenty million, one hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •