Base | Representation |
---|---|
bin | 10000000010011100001… |
… | …001101100001000111001 |
3 | 10220100210102200210110202 |
4 | 100002130021230020321 |
5 | 121024131120213221 |
6 | 2202151233051545 |
7 | 142424562305153 |
oct | 20023411541071 |
9 | 3810712623422 |
10 | 1102131413561 |
11 | 3954584a5602 |
12 | 1597256b6bb5 |
13 | 7cc13544629 |
14 | 3b4b45adad3 |
15 | 1da07b70d0b |
hex | 1009c26c239 |
1102131413561 has 2 divisors, whose sum is σ = 1102131413562. Its totient is φ = 1102131413560.
The previous prime is 1102131413527. The next prime is 1102131413639. The reversal of 1102131413561 is 1653141312011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1063746767161 + 38384646400 = 1031381^2 + 195920^2 .
It is a cyclic number.
It is not a de Polignac number, because 1102131413561 - 26 = 1102131413497 is a prime.
It is not a weakly prime, because it can be changed into another prime (1102131413261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551065706780 + 551065706781.
It is an arithmetic number, because the mean of its divisors is an integer number (551065706781).
Almost surely, 21102131413561 is an apocalyptic number.
It is an amenable number.
1102131413561 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102131413561 is an equidigital number, since it uses as much as digits as its factorization.
1102131413561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 29.
Adding to 1102131413561 its reverse (1653141312011), we get a palindrome (2755272725572).
The spelling of 1102131413561 in words is "one trillion, one hundred two billion, one hundred thirty-one million, four hundred thirteen thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •