Base | Representation |
---|---|
bin | 10100101011011000… |
… | …01001100100011111 |
3 | 1001122200002010222021 |
4 | 22111230021210133 |
5 | 140213414011221 |
6 | 5033323401011 |
7 | 542046414634 |
oct | 122554114437 |
9 | 31580063867 |
10 | 11101313311 |
11 | 4787447000 |
12 | 2199983167 |
13 | 107bc0ab5a |
14 | 77452418b |
15 | 44e903041 |
hex | 295b0991f |
11101313311 has 32 divisors (see below), whose sum is σ = 12899690496. Its totient is φ = 9537897600.
The previous prime is 11101313309. The next prime is 11101313393. The reversal of 11101313311 is 11331310111.
11101313311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11101313311 - 21 = 11101313309 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11101313011) 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, 1771095 + ... + 1777351.
It is an arithmetic number, because the mean of its divisors is an integer number (403115328).
Almost surely, 211101313311 is an apocalyptic number.
11101313311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11101313311 is a deficient number, since it is larger than the sum of its proper divisors (1798377185).
11101313311 is an equidigital number, since it uses as much as digits as its factorization.
11101313311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6364 (or 6342 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 11101313311 its reverse (11331310111), we get a palindrome (22432623422).
The spelling of 11101313311 in words is "eleven billion, one hundred one million, three hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •