Base | Representation |
---|---|
bin | 10011000101000011101… |
… | …101011100010001010111 |
3 | 11122100011212212020112212 |
4 | 103011003231130101113 |
5 | 132440113324323111 |
6 | 2442151140504035 |
7 | 163503206500130 |
oct | 23050355342127 |
9 | 4570155766485 |
10 | 1311101011031 |
11 | 466042382079 |
12 | 1921250ab01b |
13 | 96836c2a816 |
14 | 47659a30c87 |
15 | 241887b898b |
hex | 13143b5c457 |
1311101011031 has 8 divisors (see below), whose sum is σ = 1546736676864. Its totient is φ = 1087549225560.
The previous prime is 1311101011019. The next prime is 1311101011067. The reversal of 1311101011031 is 1301101011131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1311101011031 - 234 = 1293921141847 is a prime.
It is a super-2 number, since 2×13111010110312 (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 = 1311101010997 and 1311101011015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311101011001) 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, 3020969855 + ... + 3020970288.
It is an arithmetic number, because the mean of its divisors is an integer number (193342084608).
Almost surely, 21311101011031 is an apocalyptic number.
1311101011031 is a deficient number, since it is larger than the sum of its proper divisors (235635665833).
1311101011031 is an equidigital number, since it uses as much as digits as its factorization.
1311101011031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6041940181.
The product of its (nonzero) digits is 9, while the sum is 14.
Adding to 1311101011031 its reverse (1301101011131), we get a palindrome (2612202022162).
The spelling of 1311101011031 in words is "one trillion, three hundred eleven billion, one hundred one million, eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •