Base | Representation |
---|---|
bin | 10000110001000… |
… | …10101100101111 |
3 | 100210122211022211 |
4 | 20120202230233 |
5 | 242001320221 |
6 | 21542351251 |
7 | 3325342063 |
oct | 1030425457 |
9 | 323584284 |
10 | 140651311 |
11 | 72437459 |
12 | 3b12b527 |
13 | 231a7938 |
14 | 14973aa3 |
15 | c5346e1 |
hex | 8622b2f |
140651311 has 4 divisors (see below), whose sum is σ = 141941800. Its totient is φ = 139360824.
The previous prime is 140651297. The next prime is 140651317. The reversal of 140651311 is 113156041.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 113156041 = 59 ⋅1917899.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140651311 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 (140651317) 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, 645081 + ... + 645298.
It is an arithmetic number, because the mean of its divisors is an integer number (35485450).
Almost surely, 2140651311 is an apocalyptic number.
140651311 is a deficient number, since it is larger than the sum of its proper divisors (1290489).
140651311 is a wasteful number, since it uses less digits than its factorization.
140651311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1290488.
The product of its (nonzero) digits is 360, while the sum is 22.
The square root of 140651311 is about 11859.6505429123. The cubic root of 140651311 is about 520.0533857912.
It can be divided in two parts, 14065 and 1311, that added together give a square (15376 = 1242).
The spelling of 140651311 in words is "one hundred forty million, six hundred fifty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •