Base | Representation |
---|---|
bin | 10011000101010111101… |
… | …100111001111010001101 |
3 | 11122101001020222111202110 |
4 | 103011113230321322031 |
5 | 132441310210231410 |
6 | 2442244321414233 |
7 | 163514421412122 |
oct | 23052754717215 |
9 | 4571036874673 |
10 | 1311436414605 |
11 | 4661a4737809 |
12 | 1921b949a379 |
13 | 9688b572c85 |
14 | 4768c3bc749 |
15 | 241a7e6c720 |
hex | 13157b39e8d |
1311436414605 has 32 divisors (see below), whose sum is σ = 2110039916544. Its totient is φ = 695529032256.
The previous prime is 1311436414597. The next prime is 1311436414621. The reversal of 1311436414605 is 5064146341131.
It is a happy number.
It is not a de Polignac number, because 1311436414605 - 23 = 1311436414597 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1750132 + ... + 2384498.
It is an arithmetic number, because the mean of its divisors is an integer number (65938747392).
Almost surely, 21311436414605 is an apocalyptic number.
1311436414605 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1311436414605 is a deficient number, since it is larger than the sum of its proper divisors (798603501939).
1311436414605 is a wasteful number, since it uses less digits than its factorization.
1311436414605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 635145.
The product of its (nonzero) digits is 103680, while the sum is 39.
The spelling of 1311436414605 in words is "one trillion, three hundred eleven billion, four hundred thirty-six million, four hundred fourteen thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •