Base | Representation |
---|---|
bin | 101011110101011011110… |
… | …111010110100001100011 |
3 | 101122222022021221022010221 |
4 | 223311123313112201203 |
5 | 343323204201430311 |
6 | 10223500532303511 |
7 | 430426634450662 |
oct | 53653367264143 |
9 | 11588267838127 |
10 | 3012313311331 |
11 | a61573373835 |
12 | 407981771b97 |
13 | 18b0a187333c |
14 | a5b22390dd9 |
15 | 53555752671 |
hex | 2bd5bdd6863 |
3012313311331 has 2 divisors, whose sum is σ = 3012313311332. Its totient is φ = 3012313311330.
The previous prime is 3012313311281. The next prime is 3012313311341. The reversal of 3012313311331 is 1331133132103.
It is a strong prime.
It is an emirp because it is prime and its reverse (1331133132103) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3012313311331 - 211 = 3012313309283 is a prime.
It is a super-2 number, since 2×30123133113312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3012313311296 and 3012313311305.
It is not a weakly prime, because it can be changed into another prime (3012313311341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1506156655665 + 1506156655666.
It is an arithmetic number, because the mean of its divisors is an integer number (1506156655666).
Almost surely, 23012313311331 is an apocalyptic number.
3012313311331 is a deficient number, since it is larger than the sum of its proper divisors (1).
3012313311331 is an equidigital number, since it uses as much as digits as its factorization.
3012313311331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 3012313311331 its reverse (1331133132103), we get a palindrome (4343446443434).
The spelling of 3012313311331 in words is "three trillion, twelve billion, three hundred thirteen million, three hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •