Base | Representation |
---|---|
bin | 10000101100100… |
… | …10100000011101 |
3 | 100202112211011101 |
4 | 20112102200131 |
5 | 241323420301 |
6 | 21521553101 |
7 | 3320332144 |
oct | 1026224035 |
9 | 322484141 |
10 | 140060701 |
11 | 72073750 |
12 | 3aaa5791 |
13 | 2302bb71 |
14 | 1485c75b |
15 | c469701 |
hex | 859281d |
140060701 has 8 divisors (see below), whose sum is σ = 153008064. Its totient is φ = 127149120.
The previous prime is 140060699. The next prime is 140060707. The reversal of 140060701 is 107060041.
It is a happy number.
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 140060701 - 21 = 140060699 is a prime.
It is a super-2 number, since 2×1400607012 = 39233999929222802, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140060707) 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 7 ways as a sum of consecutive naturals, for example, 396 + ... + 16741.
It is an arithmetic number, because the mean of its divisors is an integer number (19126008).
Almost surely, 2140060701 is an apocalyptic number.
140060701 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
140060701 is a deficient number, since it is larger than the sum of its proper divisors (12947363).
140060701 is a wasteful number, since it uses less digits than its factorization.
140060701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17891.
The product of its (nonzero) digits is 168, while the sum is 19.
The square root of 140060701 is about 11834.7243736388. The cubic root of 140060701 is about 519.3244444809.
The spelling of 140060701 in words is "one hundred forty million, sixty thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •