Base | Representation |
---|---|
bin | 10011000101010110011… |
… | …000100100010011111101 |
3 | 11122100222201101021111220 |
4 | 103011112120210103331 |
5 | 132441234030243140 |
6 | 2442242211503553 |
7 | 163514032451514 |
oct | 23052630442375 |
9 | 4570881337456 |
10 | 1311414306045 |
11 | 466193207278 |
12 | 1921b1bb7bb9 |
13 | 96886b01b9c |
14 | 476894a567b |
15 | 241a6051bd0 |
hex | 131566244fd |
1311414306045 has 16 divisors (see below), whose sum is σ = 2098301189760. Its totient is φ = 699408196544.
The previous prime is 1311414306023. The next prime is 1311414306049. The reversal of 1311414306045 is 5406034141131.
It is a cyclic number.
It is not a de Polignac number, because 1311414306045 - 210 = 1311414305021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1311414305997 and 1311414306015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311414306049) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 82591 + ... + 1621619.
It is an arithmetic number, because the mean of its divisors is an integer number (131143824360).
Almost surely, 21311414306045 is an apocalyptic number.
1311414306045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1311414306045 is a deficient number, since it is larger than the sum of its proper divisors (786886883715).
1311414306045 is a wasteful number, since it uses less digits than its factorization.
1311414306045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1595844.
The product of its (nonzero) digits is 17280, while the sum is 33.
Adding to 1311414306045 its reverse (5406034141131), we get a palindrome (6717448447176).
The spelling of 1311414306045 in words is "one trillion, three hundred eleven billion, four hundred fourteen million, three hundred six thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •