Base | Representation |
---|---|
bin | 1111101001001… |
… | …10110110100111 |
3 | 100010221020021201 |
4 | 13310212312213 |
5 | 232043344033 |
6 | 21004423331 |
7 | 3152306041 |
oct | 764466647 |
9 | 303836251 |
10 | 131231143 |
11 | 6809299a |
12 | 37b47b47 |
13 | 21259c84 |
14 | 13600a91 |
15 | b7c347d |
hex | 7d26da7 |
131231143 has 8 divisors (see below), whose sum is σ = 139436640. Its totient is φ = 123507040.
The previous prime is 131231131. The next prime is 131231179. The reversal of 131231143 is 341132131.
It is not a de Polignac number, because 131231143 - 213 = 131222951 is a prime.
It is a super-2 number, since 2×1312311432 = 34443225786172898, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131231143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131231183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8443 + ... + 18268.
It is an arithmetic number, because the mean of its divisors is an integer number (17429580).
Almost surely, 2131231143 is an apocalyptic number.
131231143 is a deficient number, since it is larger than the sum of its proper divisors (8205497).
131231143 is an frugal number, since it uses more digits than its factorization.
131231143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26762 (or 26728 counting only the distinct ones).
The product of its digits is 216, while the sum is 19.
The square root of 131231143 is about 11455.6162208761. The cubic root of 131231143 is about 508.1738392277.
Adding to 131231143 its reverse (341132131), we get a palindrome (472363274).
The spelling of 131231143 in words is "one hundred thirty-one million, two hundred thirty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •