Base | Representation |
---|---|
bin | 10011000101010000001… |
… | …011001010111110111011 |
3 | 11122100201110100122101202 |
4 | 103011100023022332323 |
5 | 132441030343144011 |
6 | 2442224011004415 |
7 | 163511326130540 |
oct | 23052013127673 |
9 | 4570643318352 |
10 | 1311310131131 |
11 | 46613a424100 |
12 | 19218313970b |
13 | 9686b359020 |
14 | 47679708bc7 |
15 | 2419bd2523b |
hex | 131502cafbb |
1311310131131 has 48 divisors (see below), whose sum is σ = 1787522145024. Its totient is φ = 935999064000.
The previous prime is 1311310131041. The next prime is 1311310131161.
It is a happy number.
1311310131131 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 1311310131131 - 210 = 1311310130107 is a prime.
It is a super-2 number, since 2×13113101311312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1311310131161) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 987896 + ... + 1896986.
It is an arithmetic number, because the mean of its divisors is an integer number (37240044688).
Almost surely, 21311310131131 is an apocalyptic number.
1311310131131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1311310131131 is a deficient number, since it is larger than the sum of its proper divisors (476212013893).
1311310131131 is a wasteful number, since it uses less digits than its factorization.
1311310131131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 909264 (or 909253 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 20.
It can be divided in two parts, 1311310 and 131131, that added together give a palindrome (1442441).
The spelling of 1311310131131 in words is "one trillion, three hundred eleven billion, three hundred ten million, one hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •