Base | Representation |
---|---|
bin | 1110001100001010000001… |
… | …00010010001100100011101 |
3 | 11002111002000210222201222222 |
4 | 13012011000202101210131 |
5 | 13042221313123212000 |
6 | 150210532353115125 |
7 | 6400262464555121 |
oct | 706050042214435 |
9 | 132432023881888 |
10 | 31204020132125 |
11 | 9a40606971995 |
12 | 35bb66b258aa5 |
13 | 14546ac876c59 |
14 | 79c3d5789581 |
15 | 391a4c8b4a85 |
hex | 1c614089191d |
31204020132125 has 32 divisors (see below), whose sum is σ = 39343983748992. Its totient is φ = 24706374000000.
The previous prime is 31204020132113. The next prime is 31204020132161. The reversal of 31204020132125 is 52123102040213.
It is a de Polignac number, because none of the positive numbers 2k-31204020132125 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31204020132094 and 31204020132103.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 12947225 + ... + 15167025.
It is an arithmetic number, because the mean of its divisors is an integer number (1229499492156).
Almost surely, 231204020132125 is an apocalyptic number.
It is an amenable number.
31204020132125 is a deficient number, since it is larger than the sum of its proper divisors (8139963616867).
31204020132125 is a wasteful number, since it uses less digits than its factorization.
31204020132125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2220974 (or 2220964 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 31204020132125 its reverse (52123102040213), we get a palindrome (83327122172338).
The spelling of 31204020132125 in words is "thirty-one trillion, two hundred four billion, twenty million, one hundred thirty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •