Base | Representation |
---|---|
bin | 10000101101000… |
… | …00011011111101 |
3 | 100202122201102120 |
4 | 20112200123331 |
5 | 241332232012 |
6 | 21523113153 |
7 | 3320660403 |
oct | 1026403375 |
9 | 322581376 |
10 | 140117757 |
11 | 721025aa |
12 | 3ab127b9 |
13 | 2304bb20 |
14 | 14875473 |
15 | c47b58c |
hex | 85a06fd |
140117757 has 16 divisors (see below), whose sum is σ = 213030720. Its totient is φ = 81153792.
The previous prime is 140117749. The next prime is 140117767. The reversal of 140117757 is 757711041.
140117757 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 140117757 - 23 = 140117749 is a prime.
It is a super-2 number, since 2×1401177572 = 39265971653422098, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140117767) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 105007 + ... + 106332.
It is an arithmetic number, because the mean of its divisors is an integer number (13314420).
Almost surely, 2140117757 is an apocalyptic number.
140117757 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
140117757 is a deficient number, since it is larger than the sum of its proper divisors (72912963).
140117757 is a wasteful number, since it uses less digits than its factorization.
140117757 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 211372.
The product of its (nonzero) digits is 6860, while the sum is 33.
The square root of 140117757 is about 11837.1346617330. The cubic root of 140117757 is about 519.3949533215.
Adding to 140117757 its reverse (757711041), we get a palindrome (897828798).
The spelling of 140117757 in words is "one hundred forty million, one hundred seventeen thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •