Base | Representation |
---|---|
bin | 1000001011100000110… |
… | …0010010000111011111 |
3 | 111102201201110001211002 |
4 | 2002320030102013133 |
5 | 4300300432244101 |
6 | 144320324020515 |
7 | 13103305221332 |
oct | 2027014220737 |
9 | 442651401732 |
10 | 140529181151 |
11 | 54664071837 |
12 | 2329ab3173b |
13 | 103373c3438 |
14 | 6b31a1c619 |
15 | 39c7400d6b |
hex | 20b83121df |
140529181151 has 2 divisors, whose sum is σ = 140529181152. Its totient is φ = 140529181150.
The previous prime is 140529181147. The next prime is 140529181153. The reversal of 140529181151 is 151181925041.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 140529181151 - 22 = 140529181147 is a prime.
Together with 140529181153, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140529181153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70264590575 + 70264590576.
It is an arithmetic number, because the mean of its divisors is an integer number (70264590576).
Almost surely, 2140529181151 is an apocalyptic number.
140529181151 is a deficient number, since it is larger than the sum of its proper divisors (1).
140529181151 is an equidigital number, since it uses as much as digits as its factorization.
140529181151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14400, while the sum is 38.
The spelling of 140529181151 in words is "one hundred forty billion, five hundred twenty-nine million, one hundred eighty-one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •