Base | Representation |
---|---|
bin | 100011011110111010111101… |
… | …0010110010101111010110001 |
3 | 1111221002201021210000000200212 |
4 | 1012331311322112111322301 |
5 | 311402124441431012241 |
6 | 3023450425211153505 |
7 | 122512264604210300 |
oct | 10675657226257261 |
9 | 1457081253000625 |
10 | 312113031110321 |
11 | 904a3436323491 |
12 | 2b00971a745895 |
13 | 105201952792ac |
14 | 57104cbdbc437 |
15 | 2613b99a13beb |
hex | 11bdd7a595eb1 |
312113031110321 has 48 divisors (see below), whose sum is σ = 397691551958400. Its totient is φ = 243101343195648.
The previous prime is 312113031110261. The next prime is 312113031110329. The reversal of 312113031110321 is 123011130311213.
It is a de Polignac number, because none of the positive numbers 2k-312113031110321 is a prime.
It is not an unprimeable number, because it can be changed into a prime (312113031110329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1576555940 + ... + 1576753898.
It is an arithmetic number, because the mean of its divisors is an integer number (8285240665800).
Almost surely, 2312113031110321 is an apocalyptic number.
It is an amenable number.
312113031110321 is a deficient number, since it is larger than the sum of its proper divisors (85578520848079).
312113031110321 is a wasteful number, since it uses less digits than its factorization.
312113031110321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 263286 (or 263279 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 312113031110321 its reverse (123011130311213), we get a palindrome (435124161421534).
The spelling of 312113031110321 in words is "three hundred twelve trillion, one hundred thirteen billion, thirty-one million, one hundred ten thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •