Base | Representation |
---|---|
bin | 1001101001000000010010… |
… | …00101100010111111010101 |
3 | 2210001201012012002010020111 |
4 | 10310200021011202333111 |
5 | 10234320311410201122 |
6 | 113031110242203021 |
7 | 4315441341264223 |
oct | 464401105427725 |
9 | 83051165063214 |
10 | 21200111022037 |
11 | 6833a09a93682 |
12 | 2464882353471 |
13 | baa2148a104c |
14 | 53413b405b13 |
15 | 26b6e46a1d77 |
hex | 134809162fd5 |
21200111022037 has 2 divisors, whose sum is σ = 21200111022038. Its totient is φ = 21200111022036.
The previous prime is 21200111022019. The next prime is 21200111022043. The reversal of 21200111022037 is 73022011100212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19916351775076 + 1283759246961 = 4462774^2 + 1133031^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21200111022037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21200111021999 and 21200111022017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21200111092037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10600055511018 + 10600055511019.
It is an arithmetic number, because the mean of its divisors is an integer number (10600055511019).
Almost surely, 221200111022037 is an apocalyptic number.
It is an amenable number.
21200111022037 is a deficient number, since it is larger than the sum of its proper divisors (1).
21200111022037 is an equidigital number, since it uses as much as digits as its factorization.
21200111022037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 336, while the sum is 22.
Adding to 21200111022037 its reverse (73022011100212), we get a palindrome (94222122122249).
The spelling of 21200111022037 in words is "twenty-one trillion, two hundred billion, one hundred eleven million, twenty-two thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •