Base | Representation |
---|---|
bin | 10000000010011100001… |
… | …111110010001001010011 |
3 | 10220100210112200221210011 |
4 | 100002130033302021103 |
5 | 121024132022323102 |
6 | 2202151331215351 |
7 | 142424612010406 |
oct | 20023417621123 |
9 | 3810715627704 |
10 | 1102133011027 |
11 | 395459396824 |
12 | 159726147557 |
13 | 7cc13983789 |
14 | 3b4b48a7d3d |
15 | 1da07d892d7 |
hex | 1009c3f2253 |
1102133011027 has 2 divisors, whose sum is σ = 1102133011028. Its totient is φ = 1102133011026.
The previous prime is 1102133011009. The next prime is 1102133011033. The reversal of 1102133011027 is 7201103312011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1102133011027 - 215 = 1102132978259 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1102133010989 and 1102133011007.
It is not a weakly prime, because it can be changed into another prime (1102133018027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551066505513 + 551066505514.
It is an arithmetic number, because the mean of its divisors is an integer number (551066505514).
Almost surely, 21102133011027 is an apocalyptic number.
1102133011027 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102133011027 is an equidigital number, since it uses as much as digits as its factorization.
1102133011027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 22.
Adding to 1102133011027 its reverse (7201103312011), we get a palindrome (8303236323038).
The spelling of 1102133011027 in words is "one trillion, one hundred two billion, one hundred thirty-three million, eleven thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •