Base | Representation |
---|---|
bin | 10001110011001101100… |
… | …111001100000011000111 |
3 | 11022221100022211021222121 |
4 | 101303031213030003013 |
5 | 130020123400024221 |
6 | 2333534544310411 |
7 | 154242353055262 |
oct | 21631547140307 |
9 | 4287308737877 |
10 | 1223220314311 |
11 | 431845a839a6 |
12 | 17909a012407 |
13 | 8b4701c4668 |
14 | 432c03a5cd9 |
15 | 21c43518a41 |
hex | 11ccd9cc0c7 |
1223220314311 has 4 divisors (see below), whose sum is σ = 1223272307952. Its totient is φ = 1223168320672.
The previous prime is 1223220314269. The next prime is 1223220314353. The reversal of 1223220314311 is 1134130223221.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (1223220314269) and next prime (1223220314353).
It is a cyclic number.
It is not a de Polignac number, because 1223220314311 - 211 = 1223220312263 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 (1223220354311) 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, 25961515 + ... + 26008588.
It is an arithmetic number, because the mean of its divisors is an integer number (305818076988).
Almost surely, 21223220314311 is an apocalyptic number.
1223220314311 is a deficient number, since it is larger than the sum of its proper divisors (51993641).
1223220314311 is an equidigital number, since it uses as much as digits as its factorization.
1223220314311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51993640.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 1223220314311 its reverse (1134130223221), we get a palindrome (2357350537532).
The spelling of 1223220314311 in words is "one trillion, two hundred twenty-three billion, two hundred twenty million, three hundred fourteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •