Base | Representation |
---|---|
bin | 10011000101001111101… |
… | …100001101000011001011 |
3 | 11122100200220002012121002 |
4 | 103011033230031003023 |
5 | 132441021303410011 |
6 | 2442223121005215 |
7 | 163511200130105 |
oct | 23051754150313 |
9 | 4570626065532 |
10 | 1311302013131 |
11 | 466135889a10 |
12 | 19218048380b |
13 | 96869775c86 |
14 | 476785d4575 |
15 | 2419b26ec3b |
hex | 1314fb0d0cb |
1311302013131 has 4 divisors (see below), whose sum is σ = 1430511287064. Its totient is φ = 1192092739200.
The previous prime is 1311302013103. The next prime is 1311302013137. The reversal of 1311302013131 is 1313102031131.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1311302013131 - 210 = 1311302012107 is a prime.
It is a super-2 number, since 2×13113020131312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1311302013137) 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, 59604636950 + ... + 59604636971.
It is an arithmetic number, because the mean of its divisors is an integer number (357627821766).
Almost surely, 21311302013131 is an apocalyptic number.
1311302013131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1311302013131 is a deficient number, since it is larger than the sum of its proper divisors (119209273933).
1311302013131 is a wasteful number, since it uses less digits than its factorization.
1311302013131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 119209273932.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 1311302013131 its reverse (1313102031131), we get a palindrome (2624404044262).
The spelling of 1311302013131 in words is "one trillion, three hundred eleven billion, three hundred two million, thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •