Base | Representation |
---|---|
bin | 10011001110011000111… |
… | …001110001101011101011 |
3 | 11200022001010210221011120 |
4 | 103032120321301223223 |
5 | 133121123240224121 |
6 | 2450525251430323 |
7 | 164306406530214 |
oct | 23163071615353 |
9 | 4608033727146 |
10 | 1321120242411 |
11 | 46a313a31992 |
12 | 1940605b53a3 |
13 | 977728bc5b8 |
14 | 47d2a55c40b |
15 | 245731c4bc6 |
hex | 13398e71aeb |
1321120242411 has 4 divisors (see below), whose sum is σ = 1761493656552. Its totient is φ = 880746828272.
The previous prime is 1321120242373. The next prime is 1321120242419. The reversal of 1321120242411 is 1142420211231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1321120242411 - 27 = 1321120242283 is a prime.
It is a super-3 number, since 3×13211202424113 (a number of 37 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (1321120242419) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 220186707066 + ... + 220186707071.
It is an arithmetic number, because the mean of its divisors is an integer number (440373414138).
Almost surely, 21321120242411 is an apocalyptic number.
1321120242411 is a deficient number, since it is larger than the sum of its proper divisors (440373414141).
1321120242411 is an equidigital number, since it uses as much as digits as its factorization.
1321120242411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440373414140.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 1321120242411 its reverse (1142420211231), we get a palindrome (2463540453642).
The spelling of 1321120242411 in words is "one trillion, three hundred twenty-one billion, one hundred twenty million, two hundred forty-two thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •