Base | Representation |
---|---|
bin | 1001100110101011011110… |
… | …10001110000111000001101 |
3 | 2202210001222112010201002012 |
4 | 10303111233101300320031 |
5 | 10232013203101401221 |
6 | 112530255020311005 |
7 | 4306612524322025 |
oct | 463255721607015 |
9 | 82701875121065 |
10 | 21120221122061 |
11 | 6803043247356 |
12 | 24512a73a2465 |
13 | ba2822507c99 |
14 | 53031d12aa85 |
15 | 2695babd065b |
hex | 13356f470e0d |
21120221122061 has 2 divisors, whose sum is σ = 21120221122062. Its totient is φ = 21120221122060.
The previous prime is 21120221121977. The next prime is 21120221122067. The reversal of 21120221122061 is 16022112202112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16565966357161 + 4554254764900 = 4070131^2 + 2134070^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21120221122061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21120221122067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10560110561030 + 10560110561031.
It is an arithmetic number, because the mean of its divisors is an integer number (10560110561031).
Almost surely, 221120221122061 is an apocalyptic number.
It is an amenable number.
21120221122061 is a deficient number, since it is larger than the sum of its proper divisors (1).
21120221122061 is an equidigital number, since it uses as much as digits as its factorization.
21120221122061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 21120221122061 its reverse (16022112202112), we get a palindrome (37142333324173).
The spelling of 21120221122061 in words is "twenty-one trillion, one hundred twenty billion, two hundred twenty-one million, one hundred twenty-two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •