Base | Representation |
---|---|
bin | 100011011110001011000001… |
… | …1110001111101101101000011 |
3 | 1111220201212122001000120010021 |
4 | 1012330112003301331231003 |
5 | 311343433201143143021 |
6 | 3023331244341314311 |
7 | 122501662251263155 |
oct | 10674260361755503 |
9 | 1456655561016107 |
10 | 312010110131011 |
11 | 9046382109a3a6 |
12 | 2abb1796705997 |
13 | 10513572561a36 |
14 | 5709527044ad5 |
15 | 2611174143c41 |
hex | 11bc583c7db43 |
312010110131011 has 8 divisors (see below), whose sum is σ = 314926626504384. Its totient is φ = 309093603647400.
The previous prime is 312010110131009. The next prime is 312010110131033. The reversal of 312010110131011 is 110131011010213.
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 312010110131011 - 21 = 312010110131009 is a prime.
It is a super-2 number, since 2×3120101101310112 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (312010110131711) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 71106096 + ... + 75366418.
It is an arithmetic number, because the mean of its divisors is an integer number (39365828313048).
Almost surely, 2312010110131011 is an apocalyptic number.
312010110131011 is a deficient number, since it is larger than the sum of its proper divisors (2916516373373).
312010110131011 is a wasteful number, since it uses less digits than its factorization.
312010110131011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4944881.
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 312010110131011 its reverse (110131011010213), we get a palindrome (422141121141224).
The spelling of 312010110131011 in words is "three hundred twelve trillion, ten billion, one hundred ten million, one hundred thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •