Base | Representation |
---|---|
bin | 10100101101000001… |
… | …01011110101010101 |
3 | 1001200121222211101001 |
4 | 22112200223311111 |
5 | 140230430211031 |
6 | 5034534503301 |
7 | 542304444016 |
oct | 122640536525 |
9 | 31617884331 |
10 | 11115085141 |
11 | 47941a2a86 |
12 | 21a2504b31 |
13 | 1081a20474 |
14 | 7762ab00d |
15 | 450c23861 |
hex | 29682bd55 |
11115085141 has 2 divisors, whose sum is σ = 11115085142. Its totient is φ = 11115085140.
The previous prime is 11115085127. The next prime is 11115085147. The reversal of 11115085141 is 14158051111.
11115085141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10841182641 + 273902500 = 104121^2 + 16550^2 .
It is a cyclic number.
It is not a de Polignac number, because 11115085141 - 25 = 11115085109 is a prime.
It is a zygodrome in base 4.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11115085147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5557542570 + 5557542571.
It is an arithmetic number, because the mean of its divisors is an integer number (5557542571).
Almost surely, 211115085141 is an apocalyptic number.
It is an amenable number.
11115085141 is a deficient number, since it is larger than the sum of its proper divisors (1).
11115085141 is an equidigital number, since it uses as much as digits as its factorization.
11115085141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 800, while the sum is 28.
The spelling of 11115085141 in words is "eleven billion, one hundred fifteen million, eighty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •