Base | Representation |
---|---|
bin | 10000100001010110011… |
… | …001111011100001101101 |
3 | 11000112110110202200120022 |
4 | 100201112121323201231 |
5 | 122100114134113031 |
6 | 2225320445131525 |
7 | 145011212211002 |
oct | 20412631734155 |
9 | 4015413680508 |
10 | 1135321004141 |
11 | 3a853a122205 |
12 | 164048859ba5 |
13 | 830a267221c |
14 | 3cd424938a9 |
15 | 1e7eb7dd97b |
hex | 1085667b86d |
1135321004141 has 2 divisors, whose sum is σ = 1135321004142. Its totient is φ = 1135321004140.
The previous prime is 1135321004029. The next prime is 1135321004149. The reversal of 1135321004141 is 1414001235311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 666843726025 + 468477278116 = 816605^2 + 684454^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1135321004141 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1135321004141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1135321004149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 567660502070 + 567660502071.
It is an arithmetic number, because the mean of its divisors is an integer number (567660502071).
Almost surely, 21135321004141 is an apocalyptic number.
It is an amenable number.
1135321004141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1135321004141 is an equidigital number, since it uses as much as digits as its factorization.
1135321004141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 1135321004141 its reverse (1414001235311), we get a palindrome (2549322239452).
The spelling of 1135321004141 in words is "one trillion, one hundred thirty-five billion, three hundred twenty-one million, four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •