Base | Representation |
---|---|
bin | 11111111001101111011… |
… | …00101110101110101001 |
3 | 10212210100122202001220201 |
4 | 33330313230232232221 |
5 | 120424404142224342 |
6 | 2155322002552201 |
7 | 142123434620146 |
oct | 17746754565651 |
9 | 3783318661821 |
10 | 1096151133097 |
11 | 392969813359 |
12 | 158536968661 |
13 | 7c49c591437 |
14 | 3b0a82553cd |
15 | 1d7a7b30db7 |
hex | ff37b2eba9 |
1096151133097 has 2 divisors, whose sum is σ = 1096151133098. Its totient is φ = 1096151133096.
The previous prime is 1096151133073. The next prime is 1096151133109. The reversal of 1096151133097 is 7903311516901.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 841000877721 + 255150255376 = 917061^2 + 505124^2 .
It is an emirp because it is prime and its reverse (7903311516901) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1096151133097 - 27 = 1096151132969 is a prime.
It is a super-2 number, since 2×10961511330972 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1096151133047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 548075566548 + 548075566549.
It is an arithmetic number, because the mean of its divisors is an integer number (548075566549).
Almost surely, 21096151133097 is an apocalyptic number.
It is an amenable number.
1096151133097 is a deficient number, since it is larger than the sum of its proper divisors (1).
1096151133097 is an equidigital number, since it uses as much as digits as its factorization.
1096151133097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 153090, while the sum is 46.
Adding to 1096151133097 its reverse (7903311516901), we get a palindrome (8999462649998).
The spelling of 1096151133097 in words is "one trillion, ninety-six billion, one hundred fifty-one million, one hundred thirty-three thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •