Base | Representation |
---|---|
bin | 10000110011001… |
… | …00011010100111 |
3 | 100211011111120022 |
4 | 20121210122213 |
5 | 242033423422 |
6 | 21552225355 |
7 | 3330542621 |
oct | 1031443247 |
9 | 324144508 |
10 | 140920487 |
11 | 72600714 |
12 | 3b23b25b |
13 | 23270306 |
14 | 14a03c11 |
15 | c589342 |
hex | 86646a7 |
140920487 has 2 divisors, whose sum is σ = 140920488. Its totient is φ = 140920486.
The previous prime is 140920477. The next prime is 140920489. The reversal of 140920487 is 784029041.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 140920487 - 28 = 140920231 is a prime.
Together with 140920489, 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 (140920489) 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, 70460243 + 70460244.
It is an arithmetic number, because the mean of its divisors is an integer number (70460244).
Almost surely, 2140920487 is an apocalyptic number.
140920487 is a deficient number, since it is larger than the sum of its proper divisors (1).
140920487 is an equidigital number, since it uses as much as digits as its factorization.
140920487 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16128, while the sum is 35.
The square root of 140920487 is about 11870.9935136028. The cubic root of 140920487 is about 520.3849307140.
The spelling of 140920487 in words is "one hundred forty million, nine hundred twenty thousand, four hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •