Base | Representation |
---|---|
bin | 101101010010010001101… |
… | …110111011110010010101 |
3 | 102000111121201111221200011 |
4 | 231102101232323302111 |
5 | 401441334314302013 |
6 | 10341344512320221 |
7 | 440556202533664 |
oct | 55222156736225 |
9 | 12014551457604 |
10 | 3112001322133 |
11 | a9a879686820 |
12 | 423162b43071 |
13 | 1975ca847b92 |
14 | aa89bbdaddb |
15 | 55e3c3b0c3d |
hex | 2d491bbbc95 |
3112001322133 has 8 divisors (see below), whose sum is σ = 3400190339616. Its totient is φ = 2824692272400.
The previous prime is 3112001322097. The next prime is 3112001322203. The reversal of 3112001322133 is 3312231002113.
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 3112001322133 - 29 = 3112001321621 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3112001323133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 219984538 + ... + 219998683.
It is an arithmetic number, because the mean of its divisors is an integer number (425023792452).
Almost surely, 23112001322133 is an apocalyptic number.
It is an amenable number.
3112001322133 is a deficient number, since it is larger than the sum of its proper divisors (288189017483).
3112001322133 is a wasteful number, since it uses less digits than its factorization.
3112001322133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 439983875.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 3112001322133 its reverse (3312231002113), we get a palindrome (6424232324246).
The spelling of 3112001322133 in words is "three trillion, one hundred twelve billion, one million, three hundred twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •