Base | Representation |
---|---|
bin | 11001001111011011001001… |
… | …001100000010110100000001 |
3 | 112120001120001102210020001022 |
4 | 121033123021030002310001 |
5 | 104022301213112010311 |
6 | 1032033443444115225 |
7 | 32245200355612553 |
oct | 3117331114026401 |
9 | 476046042706038 |
10 | 111011100110081 |
11 | 3240a5a7a60086 |
12 | 1054a840995b15 |
13 | 49c33c0146272 |
14 | 1d5ad746774d3 |
15 | cc79c06e05db |
hex | 64f6c9302d01 |
111011100110081 has 2 divisors, whose sum is σ = 111011100110082. Its totient is φ = 111011100110080.
The previous prime is 111011100110003. The next prime is 111011100110231. The reversal of 111011100110081 is 180011001110111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 76759343860081 + 34251756250000 = 8761241^2 + 5852500^2 .
It is a cyclic number.
It is not a de Polignac number, because 111011100110081 - 218 = 111011099847937 is a prime.
It is a super-2 number, since 2×1110111001100812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (111011100110381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55505550055040 + 55505550055041.
It is an arithmetic number, because the mean of its divisors is an integer number (55505550055041).
Almost surely, 2111011100110081 is an apocalyptic number.
It is an amenable number.
111011100110081 is a deficient number, since it is larger than the sum of its proper divisors (1).
111011100110081 is an equidigital number, since it uses as much as digits as its factorization.
111011100110081 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 111011100110081 its reverse (180011001110111), we get a palindrome (291022101220192).
The spelling of 111011100110081 in words is "one hundred eleven trillion, eleven billion, one hundred million, one hundred ten thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •