Base | Representation |
---|---|
bin | 11101110101001110110000… |
… | …001000111101110110100011 |
3 | 122012112201112122122211100212 |
4 | 131311032300020331312203 |
5 | 114144100301202201202 |
6 | 1143013015503004335 |
7 | 36430661021635601 |
oct | 3565166010756643 |
9 | 565481478584325 |
10 | 131201321131427 |
11 | 38894193404978 |
12 | 1286b840b996ab |
13 | 5829301796261 |
14 | 245826bd48871 |
15 | 1027caa24a652 |
hex | 7753b023dda3 |
131201321131427 has 2 divisors, whose sum is σ = 131201321131428. Its totient is φ = 131201321131426.
The previous prime is 131201321131421. The next prime is 131201321131469. The reversal of 131201321131427 is 724131123102131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 131201321131427 - 28 = 131201321131171 is a prime.
It is a super-3 number, since 3×1312013211314273 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131201321131393 and 131201321131402.
It is not a weakly prime, because it can be changed into another prime (131201321131421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65600660565713 + 65600660565714.
It is an arithmetic number, because the mean of its divisors is an integer number (65600660565714).
Almost surely, 2131201321131427 is an apocalyptic number.
131201321131427 is a deficient number, since it is larger than the sum of its proper divisors (1).
131201321131427 is an equidigital number, since it uses as much as digits as its factorization.
131201321131427 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6048, while the sum is 32.
Adding to 131201321131427 its reverse (724131123102131), we get a palindrome (855332444233558).
The spelling of 131201321131427 in words is "one hundred thirty-one trillion, two hundred one billion, three hundred twenty-one million, one hundred thirty-one thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •