Base | Representation |
---|---|
bin | 10000110010101… |
… | …11101000100011 |
3 | 100211001211202012 |
4 | 20121113220203 |
5 | 242030240011 |
6 | 21551143135 |
7 | 3330234155 |
oct | 1031275043 |
9 | 324054665 |
10 | 140868131 |
11 | 72575348 |
12 | 3b214aab |
13 | 23252531 |
14 | 149ccad5 |
15 | c578a8b |
hex | 8657a23 |
140868131 has 2 divisors, whose sum is σ = 140868132. Its totient is φ = 140868130.
The previous prime is 140868113. The next prime is 140868149. The reversal of 140868131 is 131868041.
It is a happy number.
Together with previous prime (140868113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a balanced prime because it is at equal distance from previous prime (140868113) and next prime (140868149).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140868131 is a prime.
It is a super-2 number, since 2×1408681312 = 39687660662866322, which contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (140864131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a good prime.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70434065 + 70434066.
It is an arithmetic number, because the mean of its divisors is an integer number (70434066).
Almost surely, 2140868131 is an apocalyptic number.
140868131 is a deficient number, since it is larger than the sum of its proper divisors (1).
140868131 is an equidigital number, since it uses as much as digits as its factorization.
140868131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 32.
The square root of 140868131 is about 11868.7881015713. The cubic root of 140868131 is about 520.3204767588.
The spelling of 140868131 in words is "one hundred forty million, eight hundred sixty-eight thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •