Base | Representation |
---|---|
bin | 101101010010100000111… |
… | …100011100011110000001 |
3 | 102000112021111201110020021 |
4 | 231102200330130132001 |
5 | 401442400132201423 |
6 | 10341430110213441 |
7 | 440565421644154 |
oct | 55224074343601 |
9 | 12015244643207 |
10 | 3112256522113 |
11 | a9a99a7412a2 |
12 | 4232144b4281 |
13 | 19763b68b39b |
14 | aa8c3a6bc9b |
15 | 55e549c095d |
hex | 2d4a0f1c781 |
3112256522113 has 8 divisors (see below), whose sum is σ = 3156181073856. Its totient is φ = 3068334469200.
The previous prime is 3112256522099. The next prime is 3112256522153.
3112256522113 is nontrivially palindromic in base 10.
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 3112256522113 - 233 = 3103666587521 is a prime.
It is a super-2 number, since 2×31122565221132 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3112256522153) 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, 1958695 + ... + 3171907.
It is an arithmetic number, because the mean of its divisors is an integer number (394522634232).
Almost surely, 23112256522113 is an apocalyptic number.
It is an amenable number.
3112256522113 is a deficient number, since it is larger than the sum of its proper divisors (43924551743).
3112256522113 is a wasteful number, since it uses less digits than its factorization.
3112256522113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1249415.
The product of its digits is 21600, while the sum is 34.
The spelling of 3112256522113 in words is "three trillion, one hundred twelve billion, two hundred fifty-six million, five hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.664 sec. • engine limits •