Base | Representation |
---|---|
bin | 1010000001001010010100… |
… | …0011011111101111101001 |
3 | 1110000000210211200102022011 |
4 | 2200102211003133233221 |
5 | 2420432323204212131 |
6 | 35232130125155521 |
7 | 2214545405150461 |
oct | 240224503375751 |
9 | 43000724612264 |
10 | 11015065304041 |
11 | 3567510224907 |
12 | 129a9630bbba1 |
13 | 61b940656346 |
14 | 2a11bc318ba1 |
15 | 1417d90bd0b1 |
hex | a04a50dfbe9 |
11015065304041 has 2 divisors, whose sum is σ = 11015065304042. Its totient is φ = 11015065304040.
The previous prime is 11015065303997. The next prime is 11015065304051. The reversal of 11015065304041 is 14040356051011.
11015065304041 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., 7837060275625 + 3178005028416 = 2799475^2 + 1782696^2 .
It is a cyclic number.
It is not a de Polignac number, because 11015065304041 - 219 = 11015064779753 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11015065303994 and 11015065304012.
It is not a weakly prime, because it can be changed into another prime (11015065304051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5507532652020 + 5507532652021.
It is an arithmetic number, because the mean of its divisors is an integer number (5507532652021).
Almost surely, 211015065304041 is an apocalyptic number.
It is an amenable number.
11015065304041 is a deficient number, since it is larger than the sum of its proper divisors (1).
11015065304041 is an equidigital number, since it uses as much as digits as its factorization.
11015065304041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7200, while the sum is 31.
The spelling of 11015065304041 in words is "eleven trillion, fifteen billion, sixty-five million, three hundred four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •