Base | Representation |
---|---|
bin | 11001000010010011111100… |
… | …001010000101010101001001 |
3 | 112102212102012001201121020221 |
4 | 121002103330022011111021 |
5 | 103413020301044230321 |
6 | 1030103501412550041 |
7 | 32123120514122644 |
oct | 3102237412052511 |
9 | 472772161647227 |
10 | 110110012101961 |
11 | 320a24372a6723 |
12 | 10424084322321 |
13 | 4959439147891 |
14 | 1d294d2994a5b |
15 | cae3328eae41 |
hex | 6424fc285549 |
110110012101961 has 2 divisors, whose sum is σ = 110110012101962. Its totient is φ = 110110012101960.
The previous prime is 110110012101959. The next prime is 110110012102007. The reversal of 110110012101961 is 169101210011011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109705094960400 + 404917141561 = 10474020^2 + 636331^2 .
It is a cyclic number.
It is not a de Polignac number, because 110110012101961 - 21 = 110110012101959 is a prime.
Together with 110110012101959, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (110110012101361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055006050980 + 55055006050981.
It is an arithmetic number, because the mean of its divisors is an integer number (55055006050981).
Almost surely, 2110110012101961 is an apocalyptic number.
It is an amenable number.
110110012101961 is a deficient number, since it is larger than the sum of its proper divisors (1).
110110012101961 is an equidigital number, since it uses as much as digits as its factorization.
110110012101961 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 25.
Adding to 110110012101961 its reverse (169101210011011), we get a palindrome (279211222112972).
The spelling of 110110012101961 in words is "one hundred ten trillion, one hundred ten billion, twelve million, one hundred one thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •