Base | Representation |
---|---|
bin | 111101000100010111… |
… | …1011000011101101111 |
3 | 110112111120221211120221 |
4 | 1322020233120131233 |
5 | 4122040121004411 |
6 | 140125112352211 |
7 | 12321564210424 |
oct | 1721057303557 |
9 | 415446854527 |
10 | 131143141231 |
11 | 50687980053 |
12 | 214bb6a5667 |
13 | c49c97ba6b |
14 | 64c1237d4b |
15 | 36283bc071 |
hex | 1e88bd876f |
131143141231 has 8 divisors (see below), whose sum is σ = 131582564960. Its totient is φ = 130704357888.
The previous prime is 131143141201. The next prime is 131143141253. The reversal of 131143141231 is 132141341131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131143141231 - 227 = 131008923503 is a prime.
It is a super-2 number, since 2×1311431412312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131143141196 and 131143141205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131143141201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 251935 + ... + 570751.
It is an arithmetic number, because the mean of its divisors is an integer number (16447820620).
Almost surely, 2131143141231 is an apocalyptic number.
131143141231 is a deficient number, since it is larger than the sum of its proper divisors (439423729).
131143141231 is an equidigital number, since it uses as much as digits as its factorization.
131143141231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 320193.
The product of its digits is 864, while the sum is 25.
Adding to 131143141231 its reverse (132141341131), we get a palindrome (263284482362).
The spelling of 131143141231 in words is "one hundred thirty-one billion, one hundred forty-three million, one hundred forty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •