Base | Representation |
---|---|
bin | 10000101100001… |
… | …00111110111101 |
3 | 100202110000011211 |
4 | 20112010332331 |
5 | 241320132214 |
6 | 21520444421 |
7 | 3320011513 |
oct | 1026047675 |
9 | 322400154 |
10 | 140005309 |
11 | 72036074 |
12 | 3aa79711 |
13 | 2300c8a2 |
14 | 148464b3 |
15 | c4580c4 |
hex | 8584fbd |
140005309 has 4 divisors (see below), whose sum is σ = 142300540. Its totient is φ = 137710080.
The previous prime is 140005303. The next prime is 140005337. The reversal of 140005309 is 903500041.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 903500041 = 277 ⋅3261733.
It can be written as a sum of positive squares in 2 ways, for example, as 73908409 + 66096900 = 8597^2 + 8130^2 .
It is a cyclic number.
It is not a de Polignac number, because 140005309 - 29 = 140004797 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 140005309.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140005303) 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, 1147524 + ... + 1147645.
It is an arithmetic number, because the mean of its divisors is an integer number (35575135).
Almost surely, 2140005309 is an apocalyptic number.
It is an amenable number.
140005309 is a deficient number, since it is larger than the sum of its proper divisors (2295231).
140005309 is an equidigital number, since it uses as much as digits as its factorization.
140005309 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2295230.
The product of its (nonzero) digits is 540, while the sum is 22.
The square root of 140005309 is about 11832.3839102693. The cubic root of 140005309 is about 519.2559736620.
The spelling of 140005309 in words is "one hundred forty million, five thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •