Base | Representation |
---|---|
bin | 1011100110000001… |
… | …0100010100101001 |
3 | 22000220021000201201 |
4 | 2321200110110221 |
5 | 22333214204214 |
6 | 1232454244201 |
7 | 140060514004 |
oct | 27140242451 |
9 | 8026230651 |
10 | 3112256809 |
11 | 1357873672 |
12 | 72a356661 |
13 | 3a7a29b9c |
14 | 2174a853b |
15 | 13336a274 |
hex | b9814529 |
3112256809 has 8 divisors (see below), whose sum is σ = 3132380160. Its totient is φ = 3092166000.
The previous prime is 3112256803. The next prime is 3112256837. The reversal of 3112256809 is 9086522113.
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 3112256809 - 213 = 3112248617 is a prime.
It is a super-3 number, since 3×31122568093 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3112256803) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 200862 + ... + 215800.
It is an arithmetic number, because the mean of its divisors is an integer number (391547520).
Almost surely, 23112256809 is an apocalyptic number.
It is an amenable number.
3112256809 is a deficient number, since it is larger than the sum of its proper divisors (20123351).
3112256809 is a wasteful number, since it uses less digits than its factorization.
3112256809 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16271.
The product of its (nonzero) digits is 25920, while the sum is 37.
The square root of 3112256809 is about 55787.6044386206. The cubic root of 3112256809 is about 1460.0188915114.
The spelling of 3112256809 in words is "three billion, one hundred twelve million, two hundred fifty-six thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •