Base | Representation |
---|---|
bin | 101101010010110111000… |
… | …110011011010000100011 |
3 | 102000120020102011112200011 |
4 | 231102313012123100203 |
5 | 401444130312043342 |
6 | 10341531025305351 |
7 | 440610554323066 |
oct | 55226706332043 |
9 | 12016212145604 |
10 | 3112628237347 |
11 | aa0070548472 |
12 | 4232b8a95257 |
13 | 19769a6a8625 |
14 | aa91b18c8dd |
15 | 55e77448717 |
hex | 2d4b719b423 |
3112628237347 has 8 divisors (see below), whose sum is σ = 3118416301136. Its totient is φ = 3106841536512.
The previous prime is 3112628237297. The next prime is 3112628237399. The reversal of 3112628237347 is 7437328262113.
3112628237347 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3112628237347 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3112628237347.
It is not an unprimeable number, because it can be changed into a prime (3112628238347) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4289368 + ... + 4962250.
It is an arithmetic number, because the mean of its divisors is an integer number (389802037642).
Almost surely, 23112628237347 is an apocalyptic number.
3112628237347 is a deficient number, since it is larger than the sum of its proper divisors (5788063789).
3112628237347 is an equidigital number, since it uses as much as digits as its factorization.
3112628237347 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 681477.
The product of its digits is 2032128, while the sum is 49.
The spelling of 3112628237347 in words is "three trillion, one hundred twelve billion, six hundred twenty-eight million, two hundred thirty-seven thousand, three hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •