Base | Representation |
---|---|
bin | 11001001001100001111010… |
… | …011000100000001010010101 |
3 | 112111121211112212112000220012 |
4 | 121021201322120200022111 |
5 | 103444132143032101013 |
6 | 1031123415101050005 |
7 | 32204011024453262 |
oct | 3111417230401225 |
9 | 474554485460805 |
10 | 110606051050133 |
11 | 32273843362271 |
12 | 104a423a856905 |
13 | 499414b75cab2 |
14 | 1d4550bac2269 |
15 | cbc1b58ee1a8 |
hex | 64987a620295 |
110606051050133 has 2 divisors, whose sum is σ = 110606051050134. Its totient is φ = 110606051050132.
The previous prime is 110606051050091. The next prime is 110606051050193. The reversal of 110606051050133 is 331050150606011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 90084263160529 + 20521787889604 = 9491273^2 + 4530098^2 .
It is a cyclic number.
It is not a de Polignac number, because 110606051050133 - 212 = 110606051046037 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110606051050133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110606051050193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55303025525066 + 55303025525067.
It is an arithmetic number, because the mean of its divisors is an integer number (55303025525067).
Almost surely, 2110606051050133 is an apocalyptic number.
It is an amenable number.
110606051050133 is a deficient number, since it is larger than the sum of its proper divisors (1).
110606051050133 is an equidigital number, since it uses as much as digits as its factorization.
110606051050133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8100, while the sum is 32.
The spelling of 110606051050133 in words is "one hundred ten trillion, six hundred six billion, fifty-one million, fifty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •