Base | Representation |
---|---|
bin | 10000110000001… |
… | …10010110100101 |
3 | 100210102221001121 |
4 | 20120012112211 |
5 | 241434111310 |
6 | 21540053541 |
7 | 3324346426 |
oct | 1030062645 |
9 | 323387047 |
10 | 140535205 |
11 | 723681a8 |
12 | 3b0942b1 |
13 | 23166b35 |
14 | 1494364d |
15 | c5100da |
hex | 86065a5 |
140535205 has 4 divisors (see below), whose sum is σ = 168642252. Its totient is φ = 112428160.
The previous prime is 140535203. The next prime is 140535211. The reversal of 140535205 is 502535041.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 85211361 + 55323844 = 9231^2 + 7438^2 .
It is not a de Polignac number, because 140535205 - 21 = 140535203 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 140535205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140535203) 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 in 3 ways as a sum of consecutive naturals, for example, 14053516 + ... + 14053525.
It is an arithmetic number, because the mean of its divisors is an integer number (42160563).
Almost surely, 2140535205 is an apocalyptic number.
It is an amenable number.
140535205 is a deficient number, since it is larger than the sum of its proper divisors (28107047).
140535205 is an equidigital number, since it uses as much as digits as its factorization.
140535205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28107046.
The product of its (nonzero) digits is 3000, while the sum is 25.
The square root of 140535205 is about 11854.7545314106. The cubic root of 140535205 is about 519.9102470833.
The spelling of 140535205 in words is "one hundred forty million, five hundred thirty-five thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •