Base | Representation |
---|---|
bin | 1011111010110100111110… |
… | …0001111001010010101101 |
3 | 1201101212000110110112122221 |
4 | 2332231033201321102231 |
5 | 3204204103023134311 |
6 | 43512252101435341 |
7 | 2521553020545424 |
oct | 276551741712255 |
9 | 51355013415587 |
10 | 13105279505581 |
11 | 41a2a1069954a |
12 | 1577a8370bb51 |
13 | 740a901ca053 |
14 | 3344283042bb |
15 | 17ad72139671 |
hex | beb4f8794ad |
13105279505581 has 2 divisors, whose sum is σ = 13105279505582. Its totient is φ = 13105279505580.
The previous prime is 13105279505579. The next prime is 13105279505587. The reversal of 13105279505581 is 18550597250131.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13064906640681 + 40372864900 = 3614541^2 + 200930^2 .
It is a cyclic number.
It is not a de Polignac number, because 13105279505581 - 21 = 13105279505579 is a prime.
It is a super-2 number, since 2×131052795055812 (a number of 27 digits) contains 22 as substring.
Together with 13105279505579, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13105279505587) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6552639752790 + 6552639752791.
It is an arithmetic number, because the mean of its divisors is an integer number (6552639752791).
Almost surely, 213105279505581 is an apocalyptic number.
It is an amenable number.
13105279505581 is a deficient number, since it is larger than the sum of its proper divisors (1).
13105279505581 is an equidigital number, since it uses as much as digits as its factorization.
13105279505581 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1890000, while the sum is 52.
The spelling of 13105279505581 in words is "thirteen trillion, one hundred five billion, two hundred seventy-nine million, five hundred five thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •