Base | Representation |
---|---|
bin | 10101000101100101… |
… | …01001011010011011 |
3 | 1002012222200111121222 |
4 | 22202302221122123 |
5 | 141141201323121 |
6 | 5111214522255 |
7 | 550355635646 |
oct | 124262513233 |
9 | 32188614558 |
10 | 11321120411 |
11 | 488a528367 |
12 | 223b50638b |
13 | 10b560b823 |
14 | 7957c0a5d |
15 | 463d710ab |
hex | 2a2ca969b |
11321120411 has 2 divisors, whose sum is σ = 11321120412. Its totient is φ = 11321120410.
The previous prime is 11321120387. The next prime is 11321120429. The reversal of 11321120411 is 11402112311.
11321120411 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (11402112311) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11321120411 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11321120411.
It is not a weakly prime, because it can be changed into another prime (11321120431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5660560205 + 5660560206.
It is an arithmetic number, because the mean of its divisors is an integer number (5660560206).
Almost surely, 211321120411 is an apocalyptic number.
11321120411 is a deficient number, since it is larger than the sum of its proper divisors (1).
11321120411 is an equidigital number, since it uses as much as digits as its factorization.
11321120411 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 11321120411 its reverse (11402112311), we get a palindrome (22723232722).
The spelling of 11321120411 in words is "eleven billion, three hundred twenty-one million, one hundred twenty thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •