Base | Representation |
---|---|
bin | 1011111010110010001011… |
… | …1011010110110110111001 |
3 | 1201101210002022101222000101 |
4 | 2332230202323112312321 |
5 | 3204201034442034221 |
6 | 43512045531035401 |
7 | 2521525333236625 |
oct | 276544273266671 |
9 | 51353068358011 |
10 | 13104531205561 |
11 | 41a266725a684 |
12 | 15778b4b9bb61 |
13 | 7409a1179283 |
14 | 334396b96185 |
15 | 17ad2b5c5d91 |
hex | beb22ed6db9 |
13104531205561 has 2 divisors, whose sum is σ = 13104531205562. Its totient is φ = 13104531205560.
The previous prime is 13104531205487. The next prime is 13104531205589. The reversal of 13104531205561 is 16550213540131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12922335405225 + 182195800336 = 3594765^2 + 426844^2 .
It is a cyclic number.
It is not a de Polignac number, because 13104531205561 - 217 = 13104531074489 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13104531205561.
It is not a weakly prime, because it can be changed into another prime (13104531202561) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6552265602780 + 6552265602781.
It is an arithmetic number, because the mean of its divisors is an integer number (6552265602781).
Almost surely, 213104531205561 is an apocalyptic number.
It is an amenable number.
13104531205561 is a deficient number, since it is larger than the sum of its proper divisors (1).
13104531205561 is an equidigital number, since it uses as much as digits as its factorization.
13104531205561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54000, while the sum is 37.
Adding to 13104531205561 its reverse (16550213540131), we get a palindrome (29654744745692).
The spelling of 13104531205561 in words is "thirteen trillion, one hundred four billion, five hundred thirty-one million, two hundred five thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •