Base | Representation |
---|---|
bin | 10000101110000… |
… | …11110011101101 |
3 | 100202221002011111 |
4 | 20113003303231 |
5 | 241401401022 |
6 | 21530152021 |
7 | 3322132654 |
oct | 1027036355 |
9 | 322832144 |
10 | 140262637 |
11 | 721a1439 |
12 | 3ab82611 |
13 | 2309ca58 |
14 | 148b219b |
15 | c4a9477 |
hex | 85c3ced |
140262637 has 4 divisors (see below), whose sum is σ = 140412636. Its totient is φ = 140112640.
The previous prime is 140262623. The next prime is 140262649. The reversal of 140262637 is 736262041.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 736262041 = 83 ⋅8870627.
It can be written as a sum of positive squares in 2 ways, for example, as 33884041 + 106378596 = 5821^2 + 10314^2 .
It is a cyclic number.
It is not a de Polignac number, because 140262637 - 27 = 140262509 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140262599 and 140262608.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140262667) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 73588 + ... + 75469.
It is an arithmetic number, because the mean of its divisors is an integer number (35103159).
Almost surely, 2140262637 is an apocalyptic number.
It is an amenable number.
140262637 is a deficient number, since it is larger than the sum of its proper divisors (149999).
140262637 is an equidigital number, since it uses as much as digits as its factorization.
140262637 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149998.
The product of its (nonzero) digits is 12096, while the sum is 31.
The square root of 140262637 is about 11843.2528048674. The cubic root of 140262637 is about 519.5739076085.
The spelling of 140262637 in words is "one hundred forty million, two hundred sixty-two thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •