Base | Representation |
---|---|
bin | 110011010001100100… |
… | …0100011011110101001 |
3 | 101112012211111000010022 |
4 | 1212203020203132221 |
5 | 3301001421023311 |
6 | 122330115130225 |
7 | 10645441000316 |
oct | 1464310433651 |
9 | 345184430108 |
10 | 110111111081 |
11 | 42774940554 |
12 | 1940bba3975 |
13 | a4ca530bca |
14 | 5487c67d0d |
15 | 2ce6c445db |
hex | 19a32237a9 |
110111111081 has 2 divisors, whose sum is σ = 110111111082. Its totient is φ = 110111111080.
The previous prime is 110111110987. The next prime is 110111111083. The reversal of 110111111081 is 180111111011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 78397200025 + 31713911056 = 279995^2 + 178084^2 .
It is a cyclic number.
It is not a de Polignac number, because 110111111081 - 214 = 110111094697 is a prime.
It is a super-3 number, since 3×1101111110813 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 110111111083, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (110111111083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055555540 + 55055555541.
It is an arithmetic number, because the mean of its divisors is an integer number (55055555541).
Almost surely, 2110111111081 is an apocalyptic number.
It is an amenable number.
110111111081 is a deficient number, since it is larger than the sum of its proper divisors (1).
110111111081 is an equidigital number, since it uses as much as digits as its factorization.
110111111081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 17.
Adding to 110111111081 its reverse (180111111011), we get a palindrome (290222222092).
The spelling of 110111111081 in words is "one hundred ten billion, one hundred eleven million, one hundred eleven thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •