Base | Representation |
---|---|
bin | 10011001110100101011… |
… | …010101111100100100111 |
3 | 11200022120202220110002002 |
4 | 103032211122233210213 |
5 | 133122041013223421 |
6 | 2451002152035515 |
7 | 164314536323651 |
oct | 23164532574447 |
9 | 4608522813062 |
10 | 1321330211111 |
11 | 46a411503539 |
12 | 1940ba992b9b |
13 | 977a7257131 |
14 | 47d4a3b76d1 |
15 | 2458684cb0b |
hex | 133a56af927 |
1321330211111 has 2 divisors, whose sum is σ = 1321330211112. Its totient is φ = 1321330211110.
The previous prime is 1321330211059. The next prime is 1321330211147. The reversal of 1321330211111 is 1111120331231.
It is a strong prime.
It is an emirp because it is prime and its reverse (1111120331231) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1321330211111 is a prime.
It is a super-3 number, since 3×13213302111113 (a number of 37 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1321330241111) 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 as a sum of consecutive naturals, namely, 660665105555 + 660665105556.
It is an arithmetic number, because the mean of its divisors is an integer number (660665105556).
Almost surely, 21321330211111 is an apocalyptic number.
1321330211111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1321330211111 is an equidigital number, since it uses as much as digits as its factorization.
1321330211111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 1321330211111 its reverse (1111120331231), we get a palindrome (2432450542342).
The spelling of 1321330211111 in words is "one trillion, three hundred twenty-one billion, three hundred thirty million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •