Base | Representation |
---|---|
bin | 10011000101001100110… |
… | …001101111111011010111 |
3 | 11122100120111002221111021 |
4 | 103011030301233323113 |
5 | 132440421300310223 |
6 | 2442214213222011 |
7 | 163510034514334 |
oct | 23051461577327 |
9 | 4570514087437 |
10 | 1311253135063 |
11 | 466110235113 |
12 | 192168031907 |
13 | 9685c5c1441 |
14 | 47671d0d98b |
15 | 24196d1765d |
hex | 1314cc6fed7 |
1311253135063 has 8 divisors (see below), whose sum is σ = 1357398529200. Its totient is φ = 1265169725568.
The previous prime is 1311253135051. The next prime is 1311253135091. The reversal of 1311253135063 is 3605313521131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1311253135063 - 29 = 1311253134551 is a prime.
It is a super-2 number, since 2×13112531350632 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311253135963) 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, 15453106 + ... + 15537727.
It is an arithmetic number, because the mean of its divisors is an integer number (169674816150).
Almost surely, 21311253135063 is an apocalyptic number.
1311253135063 is a deficient number, since it is larger than the sum of its proper divisors (46145394137).
1311253135063 is a wasteful number, since it uses less digits than its factorization.
1311253135063 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30992321.
The product of its (nonzero) digits is 24300, while the sum is 34.
Adding to 1311253135063 its reverse (3605313521131), we get a palindrome (4916566656194).
The spelling of 1311253135063 in words is "one trillion, three hundred eleven billion, two hundred fifty-three million, one hundred thirty-five thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •