Base | Representation |
---|---|
bin | 1001100011110100100011… |
… | …00100100010011010101101 |
3 | 2202102200111011202121210222 |
4 | 10301322101210202122231 |
5 | 10223411040112033401 |
6 | 112413213514541125 |
7 | 4266535026406433 |
oct | 461722144423255 |
9 | 82380434677728 |
10 | 21022012221101 |
11 | 67754269464a1 |
12 | 24362594377a5 |
13 | b964a0ac0078 |
14 | 529683d06d53 |
15 | 266c6dd41c1b |
hex | 131e919226ad |
21022012221101 has 2 divisors, whose sum is σ = 21022012221102. Its totient is φ = 21022012221100.
The previous prime is 21022012221061. The next prime is 21022012221139. The reversal of 21022012221101 is 10112221022012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21021399708100 + 612513001 = 4584910^2 + 24749^2 .
It is a cyclic number.
It is not a de Polignac number, because 21022012221101 - 26 = 21022012221037 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21022012221101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21022012221181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10511006110550 + 10511006110551.
It is an arithmetic number, because the mean of its divisors is an integer number (10511006110551).
Almost surely, 221022012221101 is an apocalyptic number.
It is an amenable number.
21022012221101 is a deficient number, since it is larger than the sum of its proper divisors (1).
21022012221101 is an equidigital number, since it uses as much as digits as its factorization.
21022012221101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 21022012221101 its reverse (10112221022012), we get a palindrome (31134233243113).
The spelling of 21022012221101 in words is "twenty-one trillion, twenty-two billion, twelve million, two hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •