Base | Representation |
---|---|
bin | 10101000011001100… |
… | …10001111000110111 |
3 | 1002011121000102022102 |
4 | 22201212101320313 |
5 | 141121040213421 |
6 | 5105221452315 |
7 | 550023526436 |
oct | 124146217067 |
9 | 32147012272 |
10 | 11301101111 |
11 | 487a1a4593 |
12 | 223487109b |
13 | 10b141c6a1 |
14 | 792c8d11d |
15 | 46221960b |
hex | 2a1991e37 |
11301101111 has 2 divisors, whose sum is σ = 11301101112. Its totient is φ = 11301101110.
The previous prime is 11301101099. The next prime is 11301101137. The reversal of 11301101111 is 11110110311.
11301101111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (11110110311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11301101111 - 26 = 11301101047 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11301101092 and 11301101101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11301101171) 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, 5650550555 + 5650550556.
It is an arithmetic number, because the mean of its divisors is an integer number (5650550556).
Almost surely, 211301101111 is an apocalyptic number.
11301101111 is a deficient number, since it is larger than the sum of its proper divisors (1).
11301101111 is an equidigital number, since it uses as much as digits as its factorization.
11301101111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3, while the sum is 11.
Adding to 11301101111 its reverse (11110110311), we get a palindrome (22411211422).
The spelling of 11301101111 in words is "eleven billion, three hundred one million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •