Base | Representation |
---|---|
bin | 10011001111001111001… |
… | …001010111101111001111 |
3 | 11200101101120020122122022 |
4 | 103033033021113233033 |
5 | 133130004224100421 |
6 | 2451155441240355 |
7 | 164341100065523 |
oct | 23171711275717 |
9 | 4611346218568 |
10 | 1322030300111 |
11 | 46a740703794 |
12 | 1942753330bb |
13 | 978892c7b91 |
14 | 47db5375d83 |
15 | 245c803b7ab |
hex | 133cf257bcf |
1322030300111 has 2 divisors, whose sum is σ = 1322030300112. Its totient is φ = 1322030300110.
The previous prime is 1322030300093. The next prime is 1322030300113. The reversal of 1322030300111 is 1110030302231.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1322030300111 is a prime.
It is a super-2 number, since 2×13220303001112 (a number of 25 digits) contains 22 as substring.
Together with 1322030300113, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1322030300111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1322030300113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 661015150055 + 661015150056.
It is an arithmetic number, because the mean of its divisors is an integer number (661015150056).
Almost surely, 21322030300111 is an apocalyptic number.
1322030300111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1322030300111 is an equidigital number, since it uses as much as digits as its factorization.
1322030300111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1322030300111 its reverse (1110030302231), we get a palindrome (2432060602342).
The spelling of 1322030300111 in words is "one trillion, three hundred twenty-two billion, thirty million, three hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •