Base | Representation |
---|---|
bin | 11001000010010100000010… |
… | …101010010101101111000111 |
3 | 112102212102110200001102112011 |
4 | 121002110002222111233013 |
5 | 103413021012013033223 |
6 | 1030103520311435051 |
7 | 32123123310455305 |
oct | 3102240252255707 |
9 | 472772420042464 |
10 | 110110121221063 |
11 | 320a24929564a7 |
12 | 104240b4985a87 |
13 | 4959455931cb2 |
14 | 1d2950327b275 |
15 | cae33c2a280d |
hex | 642502a95bc7 |
110110121221063 has 2 divisors, whose sum is σ = 110110121221064. Its totient is φ = 110110121221062.
The previous prime is 110110121221049. The next prime is 110110121221081. The reversal of 110110121221063 is 360122121011011.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110110121221063 is a prime.
It is a super-2 number, since 2×1101101212210632 (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 (110110121221033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055060610531 + 55055060610532.
It is an arithmetic number, because the mean of its divisors is an integer number (55055060610532).
Almost surely, 2110110121221063 is an apocalyptic number.
110110121221063 is a deficient number, since it is larger than the sum of its proper divisors (1).
110110121221063 is an equidigital number, since it uses as much as digits as its factorization.
110110121221063 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 22.
Adding to 110110121221063 its reverse (360122121011011), we get a palindrome (470232242232074).
The spelling of 110110121221063 in words is "one hundred ten trillion, one hundred ten billion, one hundred twenty-one million, two hundred twenty-one thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •