Base | Representation |
---|---|
bin | 10000000001011001011… |
… | …000000010110110011101 |
3 | 10220020220100122010110221 |
4 | 100001121120002312131 |
5 | 121014332320300013 |
6 | 2201444133001341 |
7 | 142355036651044 |
oct | 20013130026635 |
9 | 3806810563427 |
10 | 1101011103133 |
11 | 394a33078817 |
12 | 159472483251 |
13 | 7ca95402156 |
14 | 3b4098a555b |
15 | 1d98e62708d |
hex | 10059602d9d |
1101011103133 has 2 divisors, whose sum is σ = 1101011103134. Its totient is φ = 1101011103132.
The previous prime is 1101011103121. The next prime is 1101011103139. The reversal of 1101011103133 is 3313011101011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1044375670809 + 56635432324 = 1021947^2 + 237982^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101011103133 - 225 = 1100977548701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101011103139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550505551566 + 550505551567.
It is an arithmetic number, because the mean of its divisors is an integer number (550505551567).
Almost surely, 21101011103133 is an apocalyptic number.
It is an amenable number.
1101011103133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101011103133 is an equidigital number, since it uses as much as digits as its factorization.
1101011103133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 1101011103133 its reverse (3313011101011), we get a palindrome (4414022204144).
The spelling of 1101011103133 in words is "one trillion, one hundred one billion, eleven million, one hundred three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •