Base | Representation |
---|---|
bin | 10000101100111… |
… | …11001101000101 |
3 | 100202122110111121 |
4 | 20112133031011 |
5 | 241332101314 |
6 | 21523033541 |
7 | 3320636602 |
oct | 1026371505 |
9 | 322573447 |
10 | 140112709 |
11 | 720a9830 |
12 | 3ab0b8b1 |
13 | 23049739 |
14 | 148736a9 |
15 | c479d24 |
hex | 859f345 |
140112709 has 8 divisors (see below), whose sum is σ = 153025920. Its totient is φ = 127228800.
The previous prime is 140112697. The next prime is 140112719. The reversal of 140112709 is 907211041.
140112709 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 140112709 - 25 = 140112677 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140112719) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3364 + ... + 17074.
It is an arithmetic number, because the mean of its divisors is an integer number (19128240).
Almost surely, 2140112709 is an apocalyptic number.
It is an amenable number.
140112709 is a deficient number, since it is larger than the sum of its proper divisors (12913211).
140112709 is a wasteful number, since it uses less digits than its factorization.
140112709 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14651.
The product of its (nonzero) digits is 504, while the sum is 25.
The square root of 140112709 is about 11836.9214325347. The cubic root of 140112709 is about 519.3887158603.
The spelling of 140112709 in words is "one hundred forty million, one hundred twelve thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •