Base | Representation |
---|---|
bin | 10011000101001100000… |
… | …001011001101101001101 |
3 | 11122100112121021001010110 |
4 | 103011030001121231031 |
5 | 132440410024224013 |
6 | 2442213041430233 |
7 | 163506522010161 |
oct | 23051401315515 |
9 | 4570477231113 |
10 | 1311240461133 |
11 | 466104068a99 |
12 | 19216393b379 |
13 | 96859aa4785 |
14 | 47670370ca1 |
15 | 24195b622c3 |
hex | 1314c059b4d |
1311240461133 has 8 divisors (see below), whose sum is σ = 1750099174848. Its totient is φ = 873271027424.
The previous prime is 1311240461129. The next prime is 1311240461173. The reversal of 1311240461133 is 3311640421131.
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 1311240461133 - 22 = 1311240461129 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1311240461133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311240461173) 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, 222316560 + ... + 222322457.
It is an arithmetic number, because the mean of its divisors is an integer number (218762396856).
Almost surely, 21311240461133 is an apocalyptic number.
It is an amenable number.
1311240461133 is a deficient number, since it is larger than the sum of its proper divisors (438858713715).
1311240461133 is an equidigital number, since it uses as much as digits as its factorization.
1311240461133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 444640003.
The product of its (nonzero) digits is 5184, while the sum is 30.
Adding to 1311240461133 its reverse (3311640421131), we get a palindrome (4622880882264).
The spelling of 1311240461133 in words is "one trillion, three hundred eleven billion, two hundred forty million, four hundred sixty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •