Base | Representation |
---|---|
bin | 11101110100010111100110… |
… | …100010000010111100011001 |
3 | 122012100001200201102122101202 |
4 | 131310113212202002330121 |
5 | 114142113012124232101 |
6 | 1142525503445123545 |
7 | 36423463410520514 |
oct | 3564274642027431 |
9 | 565301621378352 |
10 | 131142104133401 |
11 | 38871065a08889 |
12 | 128602753b95b5 |
13 | 582385531a05a |
14 | 2455451477d7b |
15 | 102649161336b |
hex | 7745e6882f19 |
131142104133401 has 2 divisors, whose sum is σ = 131142104133402. Its totient is φ = 131142104133400.
The previous prime is 131142104133367. The next prime is 131142104133433. The reversal of 131142104133401 is 104331401241131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129927534827776 + 1214569305625 = 11398576^2 + 1102075^2 .
It is a cyclic number.
It is not a de Polignac number, because 131142104133401 - 230 = 131141030391577 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (131142104133301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65571052066700 + 65571052066701.
It is an arithmetic number, because the mean of its divisors is an integer number (65571052066701).
Almost surely, 2131142104133401 is an apocalyptic number.
It is an amenable number.
131142104133401 is a deficient number, since it is larger than the sum of its proper divisors (1).
131142104133401 is an equidigital number, since it uses as much as digits as its factorization.
131142104133401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 29.
Adding to 131142104133401 its reverse (104331401241131), we get a palindrome (235473505374532).
The spelling of 131142104133401 in words is "one hundred thirty-one trillion, one hundred forty-two billion, one hundred four million, one hundred thirty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •