Base | Representation |
---|---|
bin | 100001111111110… |
… | …1001001001111101 |
3 | 2221111112110120121 |
4 | 1003333221021331 |
5 | 4314013211432 |
6 | 305110214541 |
7 | 40161163333 |
oct | 10377511175 |
9 | 2844473517 |
10 | 1140757117 |
11 | 535a22785 |
12 | 27a054451 |
13 | 152451016 |
14 | ab70bb53 |
15 | 6a237197 |
hex | 43fe927d |
1140757117 has 4 divisors (see below), whose sum is σ = 1144650780. Its totient is φ = 1136863456.
The previous prime is 1140757081. The next prime is 1140757129. The reversal of 1140757117 is 7117570411.
It is a happy number.
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 1087086841 + 53670276 = 32971^2 + 7326^2 .
It is a cyclic number.
It is not a de Polignac number, because 1140757117 - 219 = 1140232829 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 (1140757217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1946392 + ... + 1946977.
It is an arithmetic number, because the mean of its divisors is an integer number (286162695).
Almost surely, 21140757117 is an apocalyptic number.
It is an amenable number.
1140757117 is a deficient number, since it is larger than the sum of its proper divisors (3893663).
1140757117 is an equidigital number, since it uses as much as digits as its factorization.
1140757117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3893662.
The product of its (nonzero) digits is 6860, while the sum is 34.
The square root of 1140757117 is about 33775.0961064510. The cubic root of 1140757117 is about 1044.8751381228.
The spelling of 1140757117 in words is "one billion, one hundred forty million, seven hundred fifty-seven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •