Base | Representation |
---|---|
bin | 11001000000101101100100… |
… | …111100111011010010110001 |
3 | 112102110220111011210202021111 |
4 | 121000231210330323102301 |
5 | 103404220201341022321 |
6 | 1025541203202553321 |
7 | 32112150023116645 |
oct | 3100554474732261 |
9 | 472426434722244 |
10 | 110000101110961 |
11 | 3205a865420376 |
12 | 1040690b368841 |
13 | 494bc71213829 |
14 | 1d24067540c25 |
15 | cab54d5365e1 |
hex | 640b64f3b4b1 |
110000101110961 has 2 divisors, whose sum is σ = 110000101110962. Its totient is φ = 110000101110960.
The previous prime is 110000101110947. The next prime is 110000101111097. The reversal of 110000101110961 is 169011101000011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 63068613480625 + 46931487630336 = 7941575^2 + 6850656^2 .
It is a cyclic number.
It is not a de Polignac number, because 110000101110961 - 27 = 110000101110833 is a prime.
It is not a weakly prime, because it can be changed into another prime (110000101110901) 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, 55000050555480 + 55000050555481.
It is an arithmetic number, because the mean of its divisors is an integer number (55000050555481).
Almost surely, 2110000101110961 is an apocalyptic number.
It is an amenable number.
110000101110961 is a deficient number, since it is larger than the sum of its proper divisors (1).
110000101110961 is an equidigital number, since it uses as much as digits as its factorization.
110000101110961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 22.
Adding to 110000101110961 its reverse (169011101000011), we get a palindrome (279011202110972).
The spelling of 110000101110961 in words is "one hundred ten trillion, one hundred one million, one hundred ten thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •