Base | Representation |
---|---|
bin | 111101111111110… |
… | …100100000010111 |
3 | 2200111012121021020 |
4 | 331333310200113 |
5 | 4112233442221 |
6 | 251113452223 |
7 | 34530022020 |
oct | 7577644027 |
9 | 2614177236 |
10 | 1040140311 |
11 | 49414a8a1 |
12 | 250411073 |
13 | 137652852 |
14 | 9c1d9c47 |
15 | 614aeac6 |
hex | 3dff4817 |
1040140311 has 8 divisors (see below), whose sum is σ = 1584975744. Its totient is φ = 594365880.
The previous prime is 1040140289. The next prime is 1040140333. The reversal of 1040140311 is 1130410401.
It is an interprime number because it is at equal distance from previous prime (1040140289) and next prime (1040140333).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1040140311 - 25 = 1040140279 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1040140391) 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 7 ways as a sum of consecutive naturals, for example, 24765225 + ... + 24765266.
It is an arithmetic number, because the mean of its divisors is an integer number (198121968).
Almost surely, 21040140311 is an apocalyptic number.
1040140311 is a deficient number, since it is larger than the sum of its proper divisors (544835433).
1040140311 is an equidigital number, since it uses as much as digits as its factorization.
1040140311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49530501.
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 1040140311 is about 32251.2063495306. The cubic root of 1040140311 is about 1013.2049650434.
Adding to 1040140311 its reverse (1130410401), we get a palindrome (2170550712).
The spelling of 1040140311 in words is "one billion, forty million, one hundred forty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •