Base | Representation |
---|---|
bin | 10101001111011000… |
… | …01100000010011111 |
3 | 1002102201100100002110 |
4 | 22213230030002133 |
5 | 141323222011221 |
6 | 5123312325103 |
7 | 552404364255 |
oct | 124754140237 |
9 | 32381310073 |
10 | 11403313311 |
11 | 4921967085 |
12 | 2262b43793 |
13 | 10c9659090 |
14 | 7a26985d5 |
15 | 46b1a9776 |
hex | 2a7b0c09f |
11403313311 has 32 divisors (see below), whose sum is σ = 16663675392. Its totient is φ = 6894218880.
The previous prime is 11403313291. The next prime is 11403313331. The reversal of 11403313311 is 11331330411.
11403313311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (11403313291) and next prime (11403313331).
It is not a de Polignac number, because 11403313311 - 25 = 11403313279 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11403313331) 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 in 31 ways as a sum of consecutive naturals, for example, 576166 + ... + 595628.
It is an arithmetic number, because the mean of its divisors is an integer number (520739856).
Almost surely, 211403313311 is an apocalyptic number.
11403313311 is a deficient number, since it is larger than the sum of its proper divisors (5260362081).
11403313311 is a wasteful number, since it uses less digits than its factorization.
11403313311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19743.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 11403313311 its reverse (11331330411), we get a palindrome (22734643722).
The spelling of 11403313311 in words is "eleven billion, four hundred three million, three hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •