Base | Representation |
---|---|
bin | 10011000100111110111… |
… | …101011111101000100111 |
3 | 11122022222022221011212211 |
4 | 103010332331133220213 |
5 | 132434432430124111 |
6 | 2442135213024251 |
7 | 163501221314554 |
oct | 23047675375047 |
9 | 4568868834784 |
10 | 1311021333031 |
11 | 466001400893 |
12 | 192102485087 |
13 | 96823580b87 |
14 | 4764d20da2b |
15 | 241817ca521 |
hex | 1313ef5fa27 |
1311021333031 has 16 divisors (see below), whose sum is σ = 1389771432000. Its totient is φ = 1232453173248.
The previous prime is 1311021332947. The next prime is 1311021333047. The reversal of 1311021333031 is 1303331201131.
It is a cyclic number.
It is not a de Polignac number, because 1311021333031 - 225 = 1310987778599 is a prime.
It is a super-2 number, since 2×13110213330312 (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 = 1311021332993 and 1311021333011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311021333131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 79356190 + ... + 79372708.
It is an arithmetic number, because the mean of its divisors is an integer number (86860714500).
Almost surely, 21311021333031 is an apocalyptic number.
1311021333031 is a deficient number, since it is larger than the sum of its proper divisors (78750098969).
1311021333031 is a wasteful number, since it uses less digits than its factorization.
1311021333031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21738.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 1311021333031 its reverse (1303331201131), we get a palindrome (2614352534162).
The spelling of 1311021333031 in words is "one trillion, three hundred eleven billion, twenty-one million, three hundred thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •