Base | Representation |
---|---|
bin | 101101010010110010110… |
… | …000100000100001001101 |
3 | 102000120001100002011002212 |
4 | 231102302300200201031 |
5 | 401444003134222421 |
6 | 10341515504000205 |
7 | 440606011140251 |
oct | 55226260404115 |
9 | 12016040064085 |
10 | 3112555382861 |
11 | aa0033407851 |
12 | 423298600065 |
13 | 19768857a772 |
14 | aa911626261 |
15 | 55e70d56e5b |
hex | 2d4b2c2084d |
3112555382861 has 8 divisors (see below), whose sum is σ = 3252709872960. Its totient is φ = 2972803059072.
The previous prime is 3112555382791. The next prime is 3112555382899. The reversal of 3112555382861 is 1682835552113.
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 3112555382861 - 238 = 2837677475917 is a prime.
It is a super-2 number, since 2×31125553828612 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3112555382161) 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, 100525751 + ... + 100556708.
It is an arithmetic number, because the mean of its divisors is an integer number (406588734120).
Almost surely, 23112555382861 is an apocalyptic number.
It is an amenable number.
3112555382861 is a deficient number, since it is larger than the sum of its proper divisors (140154490099).
3112555382861 is a wasteful number, since it uses less digits than its factorization.
3112555382861 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201083155.
The product of its digits is 1728000, while the sum is 50.
The spelling of 3112555382861 in words is "three trillion, one hundred twelve billion, five hundred fifty-five million, three hundred eighty-two thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •