Base | Representation |
---|---|
bin | 10011000101000001010… |
… | …110000001000111100001 |
3 | 11122100002010011112021221 |
4 | 103011001112001013201 |
5 | 132440023144103230 |
6 | 2442143202015041 |
7 | 163502215212304 |
oct | 23050126010741 |
9 | 4570063145257 |
10 | 1311061316065 |
11 | 466021a2a716 |
12 | 192113947481 |
13 | 9682b93ca87 |
14 | 4765465ab3b |
15 | 2418507727a |
hex | 131415811e1 |
1311061316065 has 4 divisors (see below), whose sum is σ = 1573273579284. Its totient is φ = 1048849052848.
The previous prime is 1311061316041. The next prime is 1311061316083. The reversal of 1311061316065 is 5606131601131.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 467036926801 + 844024389264 = 683401^2 + 918708^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1311061316065 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1311061316065.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 131106131602 + ... + 131106131611.
It is an arithmetic number, because the mean of its divisors is an integer number (393318394821).
Almost surely, 21311061316065 is an apocalyptic number.
It is an amenable number.
1311061316065 is a deficient number, since it is larger than the sum of its proper divisors (262212263219).
1311061316065 is an equidigital number, since it uses as much as digits as its factorization.
1311061316065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262212263218.
The product of its (nonzero) digits is 9720, while the sum is 34.
Adding to 1311061316065 its reverse (5606131601131), we get a palindrome (6917192917196).
The spelling of 1311061316065 in words is "one trillion, three hundred eleven billion, sixty-one million, three hundred sixteen thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •