Base | Representation |
---|---|
bin | 10000101110001… |
… | …01010001100111 |
3 | 100202221101102002 |
4 | 20113011101213 |
5 | 241402044042 |
6 | 21530235515 |
7 | 3322156331 |
oct | 1027052147 |
9 | 322841362 |
10 | 140268647 |
11 | 721a5a02 |
12 | 3ab85b9b |
13 | 230a26cc |
14 | 148b4451 |
15 | c4ab132 |
hex | 85c5467 |
140268647 has 2 divisors, whose sum is σ = 140268648. Its totient is φ = 140268646.
The previous prime is 140268631. The next prime is 140268673. The reversal of 140268647 is 746862041.
It is a weak prime.
It is an emirp because it is prime and its reverse (746862041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 140268647 - 24 = 140268631 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 140268647.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140268617) 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, 70134323 + 70134324.
It is an arithmetic number, because the mean of its divisors is an integer number (70134324).
Almost surely, 2140268647 is an apocalyptic number.
140268647 is a deficient number, since it is larger than the sum of its proper divisors (1).
140268647 is an equidigital number, since it uses as much as digits as its factorization.
140268647 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64512, while the sum is 38.
The square root of 140268647 is about 11843.5065331176. The cubic root of 140268647 is about 519.5813284362.
The spelling of 140268647 in words is "one hundred forty million, two hundred sixty-eight thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •