Base | Representation |
---|---|
bin | 10011011000110100100… |
… | …101100000111000110111 |
3 | 11201100221211002211002112 |
4 | 103120310211200320313 |
5 | 133312043430023111 |
6 | 2500021010401235 |
7 | 165154120042262 |
oct | 23306445407067 |
9 | 4640854084075 |
10 | 1332322111031 |
11 | 47404210964a |
12 | 196267b9021b |
13 | 988395a6922 |
14 | 486b0179cd9 |
15 | 249cb83be8b |
hex | 13634960e37 |
1332322111031 has 2 divisors, whose sum is σ = 1332322111032. Its totient is φ = 1332322111030.
The previous prime is 1332322111009. The next prime is 1332322111033. The reversal of 1332322111031 is 1301112232331.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1332322111031 is a prime.
It is a super-2 number, since 2×13323221110312 (a number of 25 digits) contains 22 as substring.
Together with 1332322111033, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1332322110988 and 1332322111006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1332322111033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 666161055515 + 666161055516.
It is an arithmetic number, because the mean of its divisors is an integer number (666161055516).
Almost surely, 21332322111031 is an apocalyptic number.
1332322111031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1332322111031 is an equidigital number, since it uses as much as digits as its factorization.
1332322111031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 1332322111031 its reverse (1301112232331), we get a palindrome (2633434343362).
The spelling of 1332322111031 in words is "one trillion, three hundred thirty-two billion, three hundred twenty-two million, one hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •