Base | Representation |
---|---|
bin | 100011100000100000100001… |
… | …0000111011001110011111111 |
3 | 1111221212120020112102110222212 |
4 | 1013001001002013121303333 |
5 | 311414213124014031421 |
6 | 3024134535112531035 |
7 | 122534115405541154 |
oct | 10701010207316377 |
9 | 1457776215373885 |
10 | 312331131002111 |
11 | 90577985aa4241 |
12 | 2b043a479b0a7b |
13 | 105379124021c0 |
14 | 571ac9bc9022b |
15 | 26196b1ec3e5b |
hex | 11c10421d9cff |
312331131002111 has 12 divisors (see below), whose sum is σ = 342822696122088. Its totient is φ = 282865929931104.
The previous prime is 312331131002071. The next prime is 312331131002171. The reversal of 312331131002111 is 111200131133213.
It is a de Polignac number, because none of the positive numbers 2k-312331131002111 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312331131002171) 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 11 ways as a sum of consecutive naturals, for example, 4276480325 + ... + 4276553358.
It is an arithmetic number, because the mean of its divisors is an integer number (28568558010174).
Almost surely, 2312331131002111 is an apocalyptic number.
312331131002111 is a deficient number, since it is larger than the sum of its proper divisors (30491565119977).
312331131002111 is an equidigital number, since it uses as much as digits as its factorization.
312331131002111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8553033802 (or 8553033749 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 312331131002111 its reverse (111200131133213), we get a palindrome (423531262135324).
The spelling of 312331131002111 in words is "three hundred twelve trillion, three hundred thirty-one billion, one hundred thirty-one million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •