Base | Representation |
---|---|
bin | 11001000001000001010101… |
… | …110001001110001111011111 |
3 | 112102112221021001012000222011 |
4 | 121001001111301032033133 |
5 | 103410042131213033322 |
6 | 1025555032555332051 |
7 | 32113530622100143 |
oct | 3101012561161737 |
9 | 472487231160864 |
10 | 110021321221087 |
11 | 32068864641171 |
12 | 1040aa51a51027 |
13 | 4950c73604203 |
14 | 1d250bb8ad223 |
15 | cabd91461677 |
hex | 641055c4e3df |
110021321221087 has 2 divisors, whose sum is σ = 110021321221088. Its totient is φ = 110021321221086.
The previous prime is 110021321221001. The next prime is 110021321221153. The reversal of 110021321221087 is 780122123120011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110021321221087 - 227 = 110021187003359 is a prime.
It is a super-2 number, since 2×1100213212210872 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110021321821087) 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, 55010660610543 + 55010660610544.
It is an arithmetic number, because the mean of its divisors is an integer number (55010660610544).
Almost surely, 2110021321221087 is an apocalyptic number.
110021321221087 is a deficient number, since it is larger than the sum of its proper divisors (1).
110021321221087 is an equidigital number, since it uses as much as digits as its factorization.
110021321221087 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2688, while the sum is 31.
Adding to 110021321221087 its reverse (780122123120011), we get a palindrome (890143444341098).
The spelling of 110021321221087 in words is "one hundred ten trillion, twenty-one billion, three hundred twenty-one million, two hundred twenty-one thousand, eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •