Base | Representation |
---|---|
bin | 10101000100010011… |
… | …00001110010111111 |
3 | 1002012020101212111001 |
4 | 22202021201302333 |
5 | 141130421410221 |
6 | 5110151511131 |
7 | 550165213003 |
oct | 124211416277 |
9 | 32166355431 |
10 | 11310341311 |
11 | 4884435915 |
12 | 22379884a7 |
13 | 10b3306469 |
14 | 7941b6703 |
15 | 462e42391 |
hex | 2a2261cbf |
11310341311 has 8 divisors (see below), whose sum is σ = 11411487360. Its totient is φ = 11209582872.
The previous prime is 11310341297. The next prime is 11310341321. The reversal of 11310341311 is 11314301311.
It is a happy number.
11310341311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11310341311 - 25 = 11310341279 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11310341321) 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 7 ways as a sum of consecutive naturals, for example, 38125 + ... + 155158.
It is an arithmetic number, because the mean of its divisors is an integer number (1426435920).
Almost surely, 211310341311 is an apocalyptic number.
11310341311 is a deficient number, since it is larger than the sum of its proper divisors (101146049).
11310341311 is a wasteful number, since it uses less digits than its factorization.
11310341311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193805.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 11310341311 its reverse (11314301311), we get a palindrome (22624642622).
The spelling of 11310341311 in words is "eleven billion, three hundred ten million, three hundred forty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •