Base | Representation |
---|---|
bin | 10000000001011110110… |
… | …111110011000011110001 |
3 | 10220021010210010212211021 |
4 | 100001132313303003301 |
5 | 121020024422010022 |
6 | 2201501225215441 |
7 | 142360236506632 |
oct | 20013667630361 |
9 | 3807123125737 |
10 | 1101103313137 |
11 | 394a80129533 |
12 | 159499331581 |
13 | 7caab548c99 |
14 | 3b417c29889 |
15 | 1d99778d7c7 |
hex | 1005edf30f1 |
1101103313137 has 2 divisors, whose sum is σ = 1101103313138. Its totient is φ = 1101103313136.
The previous prime is 1101103313027. The next prime is 1101103313179. The reversal of 1101103313137 is 7313133011011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1098756782656 + 2346530481 = 1048216^2 + 48441^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101103313137 - 215 = 1101103280369 is a prime.
It is not a weakly prime, because it can be changed into another prime (1101106313137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550551656568 + 550551656569.
It is an arithmetic number, because the mean of its divisors is an integer number (550551656569).
Almost surely, 21101103313137 is an apocalyptic number.
It is an amenable number.
1101103313137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101103313137 is an equidigital number, since it uses as much as digits as its factorization.
1101103313137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 567, while the sum is 25.
Adding to 1101103313137 its reverse (7313133011011), we get a palindrome (8414236324148).
The spelling of 1101103313137 in words is "one trillion, one hundred one billion, one hundred three million, three hundred thirteen thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •