Base | Representation |
---|---|
bin | 10000110011011… |
… | …01100000000101 |
3 | 100211020101121121 |
4 | 20121231200011 |
5 | 242041121301 |
6 | 21553113541 |
7 | 3331056253 |
oct | 1031554005 |
9 | 324211547 |
10 | 140957701 |
11 | 72626675 |
12 | 3b2588b1 |
13 | 23284231 |
14 | 14a135d3 |
15 | c5953a1 |
hex | 866d805 |
140957701 has 2 divisors, whose sum is σ = 140957702. Its totient is φ = 140957700.
The previous prime is 140957699. The next prime is 140957711. The reversal of 140957701 is 107759041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 90916225 + 50041476 = 9535^2 + 7074^2 .
It is a cyclic number.
It is not a de Polignac number, because 140957701 - 21 = 140957699 is a prime.
Together with 140957699, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140957711) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70478850 + 70478851.
It is an arithmetic number, because the mean of its divisors is an integer number (70478851).
Almost surely, 2140957701 is an apocalyptic number.
It is an amenable number.
140957701 is a deficient number, since it is larger than the sum of its proper divisors (1).
140957701 is an equidigital number, since it uses as much as digits as its factorization.
140957701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8820, while the sum is 34.
The square root of 140957701 is about 11872.5608442324. The cubic root of 140957701 is about 520.4307340858.
The spelling of 140957701 in words is "one hundred forty million, nine hundred fifty-seven thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •