Base | Representation |
---|---|
bin | 10000110000001… |
… | …01010110111011 |
3 | 100210102201110201 |
4 | 20120011112323 |
5 | 241433444011 |
6 | 21540023031 |
7 | 3324331516 |
oct | 1030052673 |
9 | 323381421 |
10 | 140531131 |
11 | 72365134 |
12 | 3b091a77 |
13 | 23165020 |
14 | 14941d7d |
15 | c50dcc1 |
hex | 86055bb |
140531131 has 4 divisors (see below), whose sum is σ = 151341232. Its totient is φ = 129721032.
The previous prime is 140531123. The next prime is 140531137. The reversal of 140531131 is 131135041.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 140531131 - 23 = 140531123 is a prime.
It is a super-2 number, since 2×1405311312 = 39497997560278322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140531099 and 140531108.
It is not an unprimeable number, because it can be changed into a prime (140531137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5405031 + ... + 5405056.
It is an arithmetic number, because the mean of its divisors is an integer number (37835308).
Almost surely, 2140531131 is an apocalyptic number.
140531131 is a deficient number, since it is larger than the sum of its proper divisors (10810101).
140531131 is a wasteful number, since it uses less digits than its factorization.
140531131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10810100.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 140531131 is about 11854.5827003737. The cubic root of 140531131 is about 519.9052231113.
Adding to 140531131 its reverse (131135041), we get a palindrome (271666172).
The spelling of 140531131 in words is "one hundred forty million, five hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •