Base | Representation |
---|---|
bin | 10011000101001100001… |
… | …000001110011101001101 |
3 | 11122100112201121221002001 |
4 | 103011030020032131031 |
5 | 132440411004000221 |
6 | 2442213144032301 |
7 | 163506543140542 |
oct | 23051410163515 |
9 | 4570481557061 |
10 | 1311242250061 |
11 | 466105080047 |
12 | 192164462691 |
13 | 9685a27cb03 |
14 | 476706b8bc9 |
15 | 24195db7391 |
hex | 1314c20e74d |
1311242250061 has 4 divisors (see below), whose sum is σ = 1311258509500. Its totient is φ = 1311225990624.
The previous prime is 1311242250049. The next prime is 1311242250079. The reversal of 1311242250061 is 1600522421131.
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 411257994436 + 899984255625 = 641294^2 + 948675^2 .
It is a cyclic number.
It is not a de Polignac number, because 1311242250061 - 211 = 1311242248013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311242250041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8008146 + ... + 8170243.
It is an arithmetic number, because the mean of its divisors is an integer number (327814627375).
Almost surely, 21311242250061 is an apocalyptic number.
It is an amenable number.
1311242250061 is a deficient number, since it is larger than the sum of its proper divisors (16259439).
1311242250061 is an equidigital number, since it uses as much as digits as its factorization.
1311242250061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16259438.
The product of its (nonzero) digits is 2880, while the sum is 28.
Adding to 1311242250061 its reverse (1600522421131), we get a palindrome (2911764671192).
The spelling of 1311242250061 in words is "one trillion, three hundred eleven billion, two hundred forty-two million, two hundred fifty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •