Base | Representation |
---|---|
bin | 10000111000101000000… |
… | …111110100110111110011 |
3 | 11002220222022002011220221 |
4 | 100320220013310313303 |
5 | 123002310430411011 |
6 | 2245012510313511 |
7 | 146554445622214 |
oct | 20705007646763 |
9 | 4086868064827 |
10 | 1160314310131 |
11 | 4080a51a6999 |
12 | 168a62ab8897 |
13 | 855566a3892 |
14 | 402339b740b |
15 | 202b0adc971 |
hex | 10e281f4df3 |
1160314310131 has 8 divisors (see below), whose sum is σ = 1172715957504. Its totient is φ = 1147934517960.
The previous prime is 1160314310069. The next prime is 1160314310137. The reversal of 1160314310131 is 1310134130611.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-1160314310131 is a prime.
It is a super-2 number, since 2×11603143101312 (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 = 1160314310096 and 1160314310105.
It is not an unprimeable number, because it can be changed into a prime (1160314310137) 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, 5357041 + ... + 5569426.
It is an arithmetic number, because the mean of its divisors is an integer number (146589494688).
Almost surely, 21160314310131 is an apocalyptic number.
1160314310131 is a deficient number, since it is larger than the sum of its proper divisors (12401647373).
1160314310131 is a wasteful number, since it uses less digits than its factorization.
1160314310131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10927601.
The product of its (nonzero) digits is 648, while the sum is 25.
Adding to 1160314310131 its reverse (1310134130611), we get a palindrome (2470448440742).
The spelling of 1160314310131 in words is "one trillion, one hundred sixty billion, three hundred fourteen million, three hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •