Base | Representation |
---|---|
bin | 11001000010010100111110… |
… | …010001000010010011000001 |
3 | 112102212112001100201200021111 |
4 | 121002110332101002103001 |
5 | 103413030034013031201 |
6 | 1030104203433123321 |
7 | 32123160142355401 |
oct | 3102247621022301 |
9 | 472775040650244 |
10 | 110111121220801 |
11 | 320a295637a068 |
12 | 10424333859541 |
13 | 4959584b6c00c |
14 | 1d29599dc8801 |
15 | cae399e83b51 |
hex | 64253e4424c1 |
110111121220801 has 2 divisors, whose sum is σ = 110111121220802. Its totient is φ = 110111121220800.
The previous prime is 110111121220799. The next prime is 110111121220853. The reversal of 110111121220801 is 108022121111011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 80445669660801 + 29665451560000 = 8969151^2 + 5446600^2 .
It is a cyclic number.
It is not a de Polignac number, because 110111121220801 - 21 = 110111121220799 is a prime.
Together with 110111121220799, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (110111121220871) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055560610400 + 55055560610401.
It is an arithmetic number, because the mean of its divisors is an integer number (55055560610401).
Almost surely, 2110111121220801 is an apocalyptic number.
It is an amenable number.
110111121220801 is a deficient number, since it is larger than the sum of its proper divisors (1).
110111121220801 is an equidigital number, since it uses as much as digits as its factorization.
110111121220801 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 22.
Adding to 110111121220801 its reverse (108022121111011), we get a palindrome (218133242331812).
The spelling of 110111121220801 in words is "one hundred ten trillion, one hundred eleven billion, one hundred twenty-one million, two hundred twenty thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •