Base | Representation |
---|---|
bin | 1011111010110001011100… |
… | …0000110010000100001001 |
3 | 1201101202120101020202200112 |
4 | 2332230113000302010021 |
5 | 3204200132303114004 |
6 | 43512014030244105 |
7 | 2521520355131105 |
oct | 276542700620411 |
9 | 51352511222615 |
10 | 13104331301129 |
11 | 41a2574432502 |
12 | 157785a056635 |
13 | 74096b926623 |
14 | 3343783da905 |
15 | 17ad18c89e6e |
hex | beb17032109 |
13104331301129 has 2 divisors, whose sum is σ = 13104331301130. Its totient is φ = 13104331301128.
The previous prime is 13104331301123. The next prime is 13104331301137. The reversal of 13104331301129 is 92110313340131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10851786582025 + 2252544719104 = 3294205^2 + 1500848^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13104331301129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13104331301095 and 13104331301104.
It is not a weakly prime, because it can be changed into another prime (13104331301123) 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, 6552165650564 + 6552165650565.
It is an arithmetic number, because the mean of its divisors is an integer number (6552165650565).
Almost surely, 213104331301129 is an apocalyptic number.
It is an amenable number.
13104331301129 is a deficient number, since it is larger than the sum of its proper divisors (1).
13104331301129 is an equidigital number, since it uses as much as digits as its factorization.
13104331301129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 32.
The spelling of 13104331301129 in words is "thirteen trillion, one hundred four billion, three hundred thirty-one million, three hundred one thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •