Base | Representation |
---|---|
bin | 111101000100010011… |
… | …1101001010100110101 |
3 | 110112111110010210120111 |
4 | 1322020213221110311 |
5 | 4122034111110031 |
6 | 140125001103021 |
7 | 12321541032553 |
oct | 1721047512465 |
9 | 415443123514 |
10 | 131141113141 |
11 | 50686815345 |
12 | 214baa87a71 |
13 | c49c41b8cc |
14 | 64c0c6abd3 |
15 | 362811b1b1 |
hex | 1e889e9535 |
131141113141 has 2 divisors, whose sum is σ = 131141113142. Its totient is φ = 131141113140.
The previous prime is 131141113127. The next prime is 131141113199. The reversal of 131141113141 is 141311141131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 108935642916 + 22205470225 = 330054^2 + 149015^2 .
It is a cyclic number.
It is not a de Polignac number, because 131141113141 - 25 = 131141113109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131141114141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65570556570 + 65570556571.
It is an arithmetic number, because the mean of its divisors is an integer number (65570556571).
Almost surely, 2131141113141 is an apocalyptic number.
It is an amenable number.
131141113141 is a deficient number, since it is larger than the sum of its proper divisors (1).
131141113141 is an equidigital number, since it uses as much as digits as its factorization.
131141113141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 144, while the sum is 22.
Adding to 131141113141 its reverse (141311141131), we get a palindrome (272452254272).
The spelling of 131141113141 in words is "one hundred thirty-one billion, one hundred forty-one million, one hundred thirteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •