Base | Representation |
---|---|
bin | 10100110111010011… |
… | …01110011101111111 |
3 | 1001220122022002121000 |
4 | 22123221232131333 |
5 | 140420020410221 |
6 | 5051255341343 |
7 | 544402554516 |
oct | 123351563577 |
9 | 31818262530 |
10 | 11201341311 |
11 | 4828957576 |
12 | 2207381853 |
13 | 1096861314 |
14 | 78392167d |
15 | 4585b0e26 |
hex | 29ba6e77f |
11201341311 has 16 divisors (see below), whose sum is σ = 16700284000. Its totient is φ = 7419993984.
The previous prime is 11201341309. The next prime is 11201341351. The reversal of 11201341311 is 11314310211.
It is a happy number.
11201341311 is a `hidden beast` number, since 1 + 12 + 0 + 1 + 341 + 311 = 666.
It is not a de Polignac number, because 11201341311 - 21 = 11201341309 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 (11201341351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1316986 + ... + 1325463.
It is an arithmetic number, because the mean of its divisors is an integer number (1043767750).
Almost surely, 211201341311 is an apocalyptic number.
11201341311 is a deficient number, since it is larger than the sum of its proper divisors (5498942689).
11201341311 is a wasteful number, since it uses less digits than its factorization.
11201341311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2642615 (or 2642609 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 11201341311 its reverse (11314310211), we get a palindrome (22515651522).
It can be divided in two parts, 1120 and 1341311, that added together give a palindrome (1342431).
The spelling of 11201341311 in words is "eleven billion, two hundred one million, three hundred forty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •