Base | Representation |
---|---|
bin | 1011100110010000… |
… | …0111011101100101 |
3 | 22000222010121211220 |
4 | 2321210013131211 |
5 | 22333443041314 |
6 | 1232531450553 |
7 | 140102132340 |
oct | 27144073545 |
9 | 8028117756 |
10 | 3113252709 |
11 | 1358393926 |
12 | 72a756a59 |
13 | 3a7cb8288 |
14 | 217687457 |
15 | 1334b53a9 |
hex | b9907765 |
3113252709 has 8 divisors (see below), whose sum is σ = 4744004160. Its totient is φ = 1779001536.
The previous prime is 3113252683. The next prime is 3113252711. The reversal of 3113252709 is 9072523113.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3113252709 - 220 = 3112204133 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 3113252709.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3113252759) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 74125044 + ... + 74125085.
It is an arithmetic number, because the mean of its divisors is an integer number (593000520).
Almost surely, 23113252709 is an apocalyptic number.
It is an amenable number.
3113252709 is a deficient number, since it is larger than the sum of its proper divisors (1630751451).
3113252709 is a wasteful number, since it uses less digits than its factorization.
3113252709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148250139.
The product of its (nonzero) digits is 11340, while the sum is 33.
The square root of 3113252709 is about 55796.5295426158. The cubic root of 3113252709 is about 1460.1746067835.
The spelling of 3113252709 in words is "three billion, one hundred thirteen million, two hundred fifty-two thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •