Base | Representation |
---|---|
bin | 10011000101001010110… |
… | …011110001011111011001 |
3 | 11122100111011222011102201 |
4 | 103011022303301133121 |
5 | 132440334322030241 |
6 | 2442211033330201 |
7 | 163506154023241 |
oct | 23051263613731 |
9 | 4570434864381 |
10 | 1311220111321 |
11 | 4660a362996a |
12 | 192158b66961 |
13 | 968557cb073 |
14 | 4766b794b21 |
15 | 24193e92931 |
hex | 1314acf17d9 |
1311220111321 has 8 divisors (see below), whose sum is σ = 1334595278600. Its totient is φ = 1287905581440.
The previous prime is 1311220111301. The next prime is 1311220111339. The reversal of 1311220111321 is 1231110221131.
It can be written as a sum of positive squares in 4 ways, for example, as 142959610000 + 1168260501321 = 378100^2 + 1080861^2 .
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 1311220111321 - 27 = 1311220111193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1311220111301) 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, 15115716 + ... + 15202213.
It is an arithmetic number, because the mean of its divisors is an integer number (166824409825).
Almost surely, 21311220111321 is an apocalyptic number.
It is an amenable number.
1311220111321 is a deficient number, since it is larger than the sum of its proper divisors (23375167279).
1311220111321 is an equidigital number, since it uses as much as digits as its factorization.
1311220111321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30318699.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 1311220111321 its reverse (1231110221131), we get a palindrome (2542330332452).
The spelling of 1311220111321 in words is "one trillion, three hundred eleven billion, two hundred twenty million, one hundred eleven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •