Base | Representation |
---|---|
bin | 1111101000111… |
… | …11110001011111 |
3 | 100010212202111122 |
4 | 13310133301133 |
5 | 232041432033 |
6 | 21004041155 |
7 | 3152125352 |
oct | 764376137 |
9 | 303782448 |
10 | 131202143 |
11 | 68073126 |
12 | 37b331bb |
13 | 21249a07 |
14 | 135d4299 |
15 | b7b9a98 |
hex | 7d1fc5f |
131202143 has 4 divisors (see below), whose sum is σ = 136906608. Its totient is φ = 125497680.
The previous prime is 131202139. The next prime is 131202151. The reversal of 131202143 is 341202131.
131202143 is nontrivially palindromic in base 2.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 341202131 = 3779 ⋅90289.
It is a cyclic number.
It is not a de Polignac number, because 131202143 - 22 = 131202139 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131201143) 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 in 3 ways as a sum of consecutive naturals, for example, 2852198 + ... + 2852243.
It is an arithmetic number, because the mean of its divisors is an integer number (34226652).
Almost surely, 2131202143 is an apocalyptic number.
131202143 is a deficient number, since it is larger than the sum of its proper divisors (5704465).
131202143 is an equidigital number, since it uses as much as digits as its factorization.
131202143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5704464.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 131202143 is about 11454.3503962468. The cubic root of 131202143 is about 508.1364036854.
Adding to 131202143 its reverse (341202131), we get a palindrome (472404274).
The spelling of 131202143 in words is "one hundred thirty-one million, two hundred two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •