Base | Representation |
---|---|
bin | 10100101011101000… |
… | …10001000110011111 |
3 | 1001122211002021001002 |
4 | 22111310101012133 |
5 | 140214440110221 |
6 | 5033441140515 |
7 | 542103460004 |
oct | 122564210637 |
9 | 31584067032 |
10 | 11103441311 |
11 | 478866a886 |
12 | 219a62a73b |
13 | 107c4a4621 |
14 | 7749198ab |
15 | 44ebc380b |
hex | 295d1119f |
11103441311 has 2 divisors, whose sum is σ = 11103441312. Its totient is φ = 11103441310.
The previous prime is 11103441229. The next prime is 11103441313. The reversal of 11103441311 is 11314430111.
11103441311 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 (11314430111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11103441311 - 230 = 10029699487 is a prime.
Together with 11103441313, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11103441313) 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, 5551720655 + 5551720656.
It is an arithmetic number, because the mean of its divisors is an integer number (5551720656).
Almost surely, 211103441311 is an apocalyptic number.
11103441311 is a deficient number, since it is larger than the sum of its proper divisors (1).
11103441311 is an equidigital number, since it uses as much as digits as its factorization.
11103441311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 11103441311 its reverse (11314430111), we get a palindrome (22417871422).
The spelling of 11103441311 in words is "eleven billion, one hundred three million, four hundred forty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •