Base | Representation |
---|---|
bin | 11101110010011100101011… |
… | …110010010100101101110111 |
3 | 122011212110000122211201211212 |
4 | 131302130223302110231313 |
5 | 114132432212220322411 |
6 | 1142345115202552035 |
7 | 36411111645330635 |
oct | 3562345362245567 |
9 | 564773018751755 |
10 | 131010122042231 |
11 | 38820098514283 |
12 | 1283a78096861b |
13 | 58142808cb813 |
14 | 244ccd0a56355 |
15 | 1022d1977868b |
hex | 77272bc94b77 |
131010122042231 has 2 divisors, whose sum is σ = 131010122042232. Its totient is φ = 131010122042230.
The previous prime is 131010122042203. The next prime is 131010122042243. The reversal of 131010122042231 is 132240221010131.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131010122042231 is a prime.
It is a super-2 number, since 2×1310101220422312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131010122042197 and 131010122042206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131010122042291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65505061021115 + 65505061021116.
It is an arithmetic number, because the mean of its divisors is an integer number (65505061021116).
Almost surely, 2131010122042231 is an apocalyptic number.
131010122042231 is a deficient number, since it is larger than the sum of its proper divisors (1).
131010122042231 is an equidigital number, since it uses as much as digits as its factorization.
131010122042231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 131010122042231 its reverse (132240221010131), we get a palindrome (263250343052362).
The spelling of 131010122042231 in words is "one hundred thirty-one trillion, ten billion, one hundred twenty-two million, forty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •