Base | Representation |
---|---|
bin | 1011111000001101010000… |
… | …1110011110101000101011 |
3 | 1201020112211001110212210121 |
4 | 2332003110032132220223 |
5 | 3202434403323121011 |
6 | 43435445014024111 |
7 | 2515400306030224 |
oct | 276032416365053 |
9 | 51215731425717 |
10 | 13060261145131 |
11 | 4185909a32a82 |
12 | 156b1bb048037 |
13 | 73976755ab45 |
14 | 33219745624b |
15 | 179ad9cc0e71 |
hex | be0d439ea2b |
13060261145131 has 2 divisors, whose sum is σ = 13060261145132. Its totient is φ = 13060261145130.
The previous prime is 13060261145083. The next prime is 13060261145159. The reversal of 13060261145131 is 13154116206031.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13060261145131 - 225 = 13060227590699 is a prime.
It is a super-2 number, since 2×130602611451312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13060261145531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6530130572565 + 6530130572566.
It is an arithmetic number, because the mean of its divisors is an integer number (6530130572566).
Almost surely, 213060261145131 is an apocalyptic number.
13060261145131 is a deficient number, since it is larger than the sum of its proper divisors (1).
13060261145131 is an equidigital number, since it uses as much as digits as its factorization.
13060261145131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 34.
The spelling of 13060261145131 in words is "thirteen trillion, sixty billion, two hundred sixty-one million, one hundred forty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •