Base | Representation |
---|---|
bin | 11001000000101101100100… |
… | …111100100000001100011001 |
3 | 112102110220111011121010000101 |
4 | 121000231210330200030121 |
5 | 103404220201323444321 |
6 | 1025541203200335401 |
7 | 32112150022145224 |
oct | 3100554474401431 |
9 | 472426434533011 |
10 | 110000100999961 |
11 | 3205a865354a37 |
12 | 1040690b314561 |
13 | 494bc711a5153 |
14 | 1d240675125bb |
15 | cab54d513791 |
hex | 640b64f20319 |
110000100999961 has 2 divisors, whose sum is σ = 110000100999962. Its totient is φ = 110000100999960.
The previous prime is 110000100999953. The next prime is 110000101000033. The reversal of 110000100999961 is 169999001000011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 68635342776025 + 41364758223936 = 8284645^2 + 6431544^2 .
It is a cyclic number.
It is not a de Polignac number, because 110000100999961 - 23 = 110000100999953 is a prime.
It is not a weakly prime, because it can be changed into another prime (110000100999931) 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, 55000050499980 + 55000050499981.
It is an arithmetic number, because the mean of its divisors is an integer number (55000050499981).
Almost surely, 2110000100999961 is an apocalyptic number.
It is an amenable number.
110000100999961 is a deficient number, since it is larger than the sum of its proper divisors (1).
110000100999961 is an equidigital number, since it uses as much as digits as its factorization.
110000100999961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 39366, while the sum is 46.
Adding to 110000100999961 its reverse (169999001000011), we get a palindrome (279999101999972).
The spelling of 110000100999961 in words is "one hundred ten trillion, one hundred million, nine hundred ninety-nine thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •