Base | Representation |
---|---|
bin | 1011111000010000011010… |
… | …00111101110001001111001 |
3 | 10102111020222210222101120121 |
4 | 11330020031013232021321 |
5 | 11410441242033102022 |
6 | 131320213403453241 |
7 | 5334160513544212 |
oct | 574101507561171 |
9 | 112436883871517 |
10 | 26122211222137 |
11 | 8361405259518 |
12 | 2b1a7ab827221 |
13 | 117641098b454 |
14 | 664470d12409 |
15 | 304772eab2c7 |
hex | 17c20d1ee279 |
26122211222137 has 2 divisors, whose sum is σ = 26122211222138. Its totient is φ = 26122211222136.
The previous prime is 26122211222111. The next prime is 26122211222143. The reversal of 26122211222137 is 73122211222162.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20042490349456 + 6079720872681 = 4476884^2 + 2465709^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-26122211222137 is a prime.
It is not a weakly prime, because it can be changed into another prime (26122211222197) 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, 13061105611068 + 13061105611069.
It is an arithmetic number, because the mean of its divisors is an integer number (13061105611069).
Almost surely, 226122211222137 is an apocalyptic number.
It is an amenable number.
26122211222137 is a deficient number, since it is larger than the sum of its proper divisors (1).
26122211222137 is an equidigital number, since it uses as much as digits as its factorization.
26122211222137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 16128, while the sum is 34.
Adding to 26122211222137 its reverse (73122211222162), we get a palindrome (99244422444299).
The spelling of 26122211222137 in words is "twenty-six trillion, one hundred twenty-two billion, two hundred eleven million, two hundred twenty-two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •