Base | Representation |
---|---|
bin | 11001000001100101011101… |
… | …011101110010011111111111 |
3 | 112102200122100221210200112011 |
4 | 121001211131131302133333 |
5 | 103411211043343100421 |
6 | 1030024525251352051 |
7 | 32116403001152026 |
oct | 3101453535623777 |
9 | 472618327720464 |
10 | 110060105050111 |
11 | 32083257048a27 |
12 | 104164765b2627 |
13 | 495481471c978 |
14 | 1d26d1a73b8bd |
15 | cacdb12b64e1 |
hex | 64195d7727ff |
110060105050111 has 2 divisors, whose sum is σ = 110060105050112. Its totient is φ = 110060105050110.
The previous prime is 110060105050009. The next prime is 110060105050117. The reversal of 110060105050111 is 111050501060011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110060105050111 is a prime.
It is a super-2 number, since 2×1100601050501112 (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 (110060105050117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55030052525055 + 55030052525056.
It is an arithmetic number, because the mean of its divisors is an integer number (55030052525056).
Almost surely, 2110060105050111 is an apocalyptic number.
110060105050111 is a deficient number, since it is larger than the sum of its proper divisors (1).
110060105050111 is an equidigital number, since it uses as much as digits as its factorization.
110060105050111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 150, while the sum is 22.
The spelling of 110060105050111 in words is "one hundred ten trillion, sixty billion, one hundred five million, fifty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •