Base | Representation |
---|---|
bin | 10000001001110111110… |
… | …001110010010001011001 |
3 | 10221010101112212222012112 |
4 | 100021313301302101121 |
5 | 121142001420231131 |
6 | 2205551125322105 |
7 | 143126405451104 |
oct | 20116761622131 |
9 | 3833345788175 |
10 | 1110111102041 |
11 | 39888285a677 |
12 | 15b191b66335 |
13 | 808b57c55a6 |
14 | 3ba302ab73b |
15 | 1dd234a802b |
hex | 10277c72459 |
1110111102041 has 2 divisors, whose sum is σ = 1110111102042. Its totient is φ = 1110111102040.
The previous prime is 1110111101977. The next prime is 1110111102043. The reversal of 1110111102041 is 1402011110111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 646617015625 + 463494086416 = 804125^2 + 680804^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110111102041 - 26 = 1110111101977 is a prime.
Together with 1110111102043, 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 (1110111102043) 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, 555055551020 + 555055551021.
It is an arithmetic number, because the mean of its divisors is an integer number (555055551021).
Almost surely, 21110111102041 is an apocalyptic number.
It is an amenable number.
1110111102041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110111102041 is an equidigital number, since it uses as much as digits as its factorization.
1110111102041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 1110111102041 its reverse (1402011110111), we get a palindrome (2512122212152).
The spelling of 1110111102041 in words is "one trillion, one hundred ten billion, one hundred eleven million, one hundred two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •