Base | Representation |
---|---|
bin | 10000001000011001101… |
… | …000000111111011110011 |
3 | 10220222022110121102200122 |
4 | 100020121220013323303 |
5 | 121130233031323102 |
6 | 2205130301240455 |
7 | 143042305242353 |
oct | 20103150077363 |
9 | 3828273542618 |
10 | 1108531511027 |
11 | 398142158556 |
12 | 15aa10b6312b |
13 | 806c3487155 |
14 | 3b9205aab63 |
15 | 1dc7e98b0a2 |
hex | 10219a07ef3 |
1108531511027 has 2 divisors, whose sum is σ = 1108531511028. Its totient is φ = 1108531511026.
The previous prime is 1108531511023. The next prime is 1108531511039. The reversal of 1108531511027 is 7201151358011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1108531511027 - 22 = 1108531511023 is a prime.
It is a super-2 number, since 2×11085315110272 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1108531511023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 554265755513 + 554265755514.
It is an arithmetic number, because the mean of its divisors is an integer number (554265755514).
Almost surely, 21108531511027 is an apocalyptic number.
1108531511027 is a deficient number, since it is larger than the sum of its proper divisors (1).
1108531511027 is an equidigital number, since it uses as much as digits as its factorization.
1108531511027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8400, while the sum is 35.
Adding to 1108531511027 its reverse (7201151358011), we get a palindrome (8309682869038).
The spelling of 1108531511027 in words is "one trillion, one hundred eight billion, five hundred thirty-one million, five hundred eleven thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •