Base | Representation |
---|---|
bin | 10011000100111101110… |
… | …011110111010011100011 |
3 | 11122022220222121112221001 |
4 | 103010331303313103203 |
5 | 132434413010000311 |
6 | 2442133243212431 |
7 | 163500565254436 |
oct | 23047563672343 |
9 | 4568828545831 |
10 | 1311002031331 |
11 | 465aa1518173 |
12 | 1920b7b17117 |
13 | 9681c583555 |
14 | 4764a82781d |
15 | 2417ec664c1 |
hex | 1313dcf74e3 |
1311002031331 has 4 divisors (see below), whose sum is σ = 1323254386872. Its totient is φ = 1298749675792.
The previous prime is 1311002031329. The next prime is 1311002031377. The reversal of 1311002031331 is 1331302001131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1311002031331 - 21 = 1311002031329 is a prime.
It is a super-2 number, since 2×13110020313312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1311002031299 and 1311002031308.
It is not an unprimeable number, because it can be changed into a prime (1311002031301) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6126177610 + ... + 6126177823.
It is an arithmetic number, because the mean of its divisors is an integer number (330813596718).
Almost surely, 21311002031331 is an apocalyptic number.
1311002031331 is a deficient number, since it is larger than the sum of its proper divisors (12252355541).
1311002031331 is a wasteful number, since it uses less digits than its factorization.
1311002031331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12252355540.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1311002031331 its reverse (1331302001131), we get a palindrome (2642304032462).
The spelling of 1311002031331 in words is "one trillion, three hundred eleven billion, two million, thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •