Base | Representation |
---|---|
bin | 11101111001110001011100… |
… | …001000011010111111111011 |
3 | 122020122120012001111101201211 |
4 | 131321301130020122333323 |
5 | 114214204013221041011 |
6 | 1143412235310023551 |
7 | 36462350515136164 |
oct | 3571613410327773 |
9 | 566576161441654 |
10 | 131513444315131 |
11 | 389a45a184955a |
12 | 1290022a4a7bb7 |
13 | 584c884129738 |
14 | 24693db1b276b |
15 | 1030e76dadb21 |
hex | 779c5c21affb |
131513444315131 has 2 divisors, whose sum is σ = 131513444315132. Its totient is φ = 131513444315130.
The previous prime is 131513444315119. The next prime is 131513444315137.
131513444315131 is nontrivially palindromic in base 10.
It is a strong prime.
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 131513444315131 - 233 = 131504854380539 is a prime.
It is a super-2 number, since 2×1315134443151312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (131513444315137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65756722157565 + 65756722157566.
It is an arithmetic number, because the mean of its divisors is an integer number (65756722157566).
Almost surely, 2131513444315131 is an apocalyptic number.
131513444315131 is a deficient number, since it is larger than the sum of its proper divisors (1).
131513444315131 is an equidigital number, since it uses as much as digits as its factorization.
131513444315131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 129600, while the sum is 40.
The spelling of 131513444315131 in words is "one hundred thirty-one trillion, five hundred thirteen billion, four hundred forty-four million, three hundred fifteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •