Base | Representation |
---|---|
bin | 10000101111111… |
… | …10100011011101 |
3 | 100210101022020111 |
4 | 20113332203131 |
5 | 241432101021 |
6 | 21535250021 |
7 | 3324154333 |
oct | 1027764335 |
9 | 323338214 |
10 | 140503261 |
11 | 723461a8 |
12 | 3b079911 |
13 | 23155432 |
14 | 14935b53 |
15 | c5058e1 |
hex | 85fe8dd |
140503261 has 2 divisors, whose sum is σ = 140503262. Its totient is φ = 140503260.
The previous prime is 140503247. The next prime is 140503301. The reversal of 140503261 is 162305041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111408025 + 29095236 = 10555^2 + 5394^2 .
It is a cyclic number.
It is not a de Polignac number, because 140503261 - 29 = 140502749 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140503201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70251630 + 70251631.
It is an arithmetic number, because the mean of its divisors is an integer number (70251631).
Almost surely, 2140503261 is an apocalyptic number.
It is an amenable number.
140503261 is a deficient number, since it is larger than the sum of its proper divisors (1).
140503261 is an equidigital number, since it uses as much as digits as its factorization.
140503261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 140503261 is about 11853.4071473142. The cubic root of 140503261 is about 519.8708518029.
The spelling of 140503261 in words is "one hundred forty million, five hundred three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.059 sec. • engine limits •