Base | Representation |
---|---|
bin | 10000110000111… |
… | …11001001011001 |
3 | 100210122002100221 |
4 | 20120133021121 |
5 | 242000334021 |
6 | 21542200041 |
7 | 3325251466 |
oct | 1030371131 |
9 | 323562327 |
10 | 140636761 |
11 | 72427531 |
12 | 3b123021 |
13 | 231a1125 |
14 | 1496c66d |
15 | c530241 |
hex | 861f259 |
140636761 has 2 divisors, whose sum is σ = 140636762. Its totient is φ = 140636760.
The previous prime is 140636759. The next prime is 140636791. The reversal of 140636761 is 167636041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 96825600 + 43811161 = 9840^2 + 6619^2 .
It is a cyclic number.
It is not a de Polignac number, because 140636761 - 21 = 140636759 is a prime.
It is a super-2 number, since 2×1406367612 = 39557397089142242, which contains 22 as substring.
Together with 140636759, it forms a pair of twin primes.
It is equal to p7946044 and since 140636761 and 7946044 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (140636731) 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, 70318380 + 70318381.
It is an arithmetic number, because the mean of its divisors is an integer number (70318381).
Almost surely, 2140636761 is an apocalyptic number.
It is an amenable number.
140636761 is a deficient number, since it is larger than the sum of its proper divisors (1).
140636761 is an equidigital number, since it uses as much as digits as its factorization.
140636761 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 34.
The square root of 140636761 is about 11859.0371025644. The cubic root of 140636761 is about 520.0354524645.
The spelling of 140636761 in words is "one hundred forty million, six hundred thirty-six thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •