Base | Representation |
---|---|
bin | 1010000110111100000010… |
… | …0101000101010000110111 |
3 | 1110100111222110121110211220 |
4 | 2201233000211011100313 |
5 | 2424044102200403421 |
6 | 35345502200201423 |
7 | 2224660665433356 |
oct | 241570045052067 |
9 | 43314873543756 |
10 | 11114311341111 |
11 | 35a560a003450 |
12 | 12b6040469273 |
13 | 6280c8bb1574 |
14 | 2a5d1519599d |
15 | 1441970263c6 |
hex | a1bc0945437 |
11114311341111 has 16 divisors (see below), whose sum is σ = 16603197287808. Its totient is φ = 6553893664800.
The previous prime is 11114311341109. The next prime is 11114311341131.
11114311341111 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 11114311341111 - 21 = 11114311341109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11114311341131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4551313825 + ... + 4551316266.
It is an arithmetic number, because the mean of its divisors is an integer number (1037699830488).
Almost surely, 211114311341111 is an apocalyptic number.
11114311341111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11114311341111 is a deficient number, since it is larger than the sum of its proper divisors (5488885946697).
11114311341111 is a wasteful number, since it uses less digits than its factorization.
11114311341111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9102630142.
The product of its digits is 144, while the sum is 24.
It can be divided in two parts, 1111431 and 1341111, that added together give a palindrome (2452542).
The spelling of 11114311341111 in words is "eleven trillion, one hundred fourteen billion, three hundred eleven million, three hundred forty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •