Base | Representation |
---|---|
bin | 10011000101000101100… |
… | …101010001100000011101 |
3 | 11122100021001222012100100 |
4 | 103011011211101200131 |
5 | 132440144400033341 |
6 | 2442154222051313 |
7 | 163504040502564 |
oct | 23050545214035 |
9 | 4570231865310 |
10 | 1311132424221 |
11 | 466059088294 |
12 | 192133719b39 |
13 | 968405a8ac9 |
14 | 4765dc8abdb |
15 | 2418b4213b6 |
hex | 1314595181d |
1311132424221 has 12 divisors (see below), whose sum is σ = 1894022507520. Its totient is φ = 874012331400.
The previous prime is 1311132424219. The next prime is 1311132424229. The reversal of 1311132424221 is 1224242311131.
1311132424221 is a `hidden beast` number, since 1 + 3 + 1 + 1 + 13 + 2 + 424 + 221 = 666.
It is not a de Polignac number, because 1311132424221 - 21 = 1311132424219 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311132424229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6219855 + ... + 6427196.
It is an arithmetic number, because the mean of its divisors is an integer number (157835208960).
Almost surely, 21311132424221 is an apocalyptic number.
It is an amenable number.
1311132424221 is a deficient number, since it is larger than the sum of its proper divisors (582890083299).
1311132424221 is a wasteful number, since it uses less digits than its factorization.
1311132424221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12658576 (or 12658573 counting only the distinct ones).
The product of its digits is 2304, while the sum is 27.
Adding to 1311132424221 its reverse (1224242311131), we get a palindrome (2535374735352).
The spelling of 1311132424221 in words is "one trillion, three hundred eleven billion, one hundred thirty-two million, four hundred twenty-four thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •