Base | Representation |
---|---|
bin | 10000101111100… |
… | …01110101000001 |
3 | 100210021122201222 |
4 | 20113301311001 |
5 | 241423414022 |
6 | 21534204425 |
7 | 3323546351 |
oct | 1027616501 |
9 | 323248658 |
10 | 140451137 |
11 | 72310022 |
12 | 3b053715 |
13 | 231377a8 |
14 | 14920b61 |
15 | c4e5242 |
hex | 85f1d41 |
140451137 has 2 divisors, whose sum is σ = 140451138. Its totient is φ = 140451136.
The previous prime is 140451131. The next prime is 140451139. The reversal of 140451137 is 731154041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96904336 + 43546801 = 9844^2 + 6599^2 .
It is a cyclic number.
It is not a de Polignac number, because 140451137 - 222 = 136256833 is a prime.
Together with 140451139, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (140451131) 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 as a sum of consecutive naturals, namely, 70225568 + 70225569.
It is an arithmetic number, because the mean of its divisors is an integer number (70225569).
Almost surely, 2140451137 is an apocalyptic number.
It is an amenable number.
140451137 is a deficient number, since it is larger than the sum of its proper divisors (1).
140451137 is an equidigital number, since it uses as much as digits as its factorization.
140451137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1680, while the sum is 26.
The square root of 140451137 is about 11851.2082506384. The cubic root of 140451137 is about 519.8065564983.
The spelling of 140451137 in words is "one hundred forty million, four hundred fifty-one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •