Base | Representation |
---|---|
bin | 111101001101001110… |
… | …0011100001011111111 |
3 | 110120021021212020110122 |
4 | 1322122130130023333 |
5 | 4123142140300011 |
6 | 140214402525155 |
7 | 12332131654655 |
oct | 1723234341377 |
9 | 416237766418 |
10 | 131440165631 |
11 | 5081a601965 |
12 | 215830667bb |
13 | c519377348 |
14 | 650c874dd5 |
15 | 36444de3db |
hex | 1e9a71c2ff |
131440165631 has 2 divisors, whose sum is σ = 131440165632. Its totient is φ = 131440165630.
The previous prime is 131440165601. The next prime is 131440165651. The reversal of 131440165631 is 136561044131.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131440165631 is a prime.
It is a super-2 number, since 2×1314401656312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131440165591 and 131440165600.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131440165601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65720082815 + 65720082816.
It is an arithmetic number, because the mean of its divisors is an integer number (65720082816).
Almost surely, 2131440165631 is an apocalyptic number.
131440165631 is a deficient number, since it is larger than the sum of its proper divisors (1).
131440165631 is an equidigital number, since it uses as much as digits as its factorization.
131440165631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 35.
The spelling of 131440165631 in words is "one hundred thirty-one billion, four hundred forty million, one hundred sixty-five thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •