Base | Representation |
---|---|
bin | 10100110111111010… |
… | …00100001110000101 |
3 | 1001220222211200002111 |
4 | 22123331010032011 |
5 | 140422320124031 |
6 | 5052000141021 |
7 | 544463631412 |
oct | 123375041605 |
9 | 31828750074 |
10 | 11206411141 |
11 | 48307aa612 |
12 | 2209007771 |
13 | 1097917b13 |
14 | 784481109 |
15 | 458c631b1 |
hex | 29bf44385 |
11206411141 has 16 divisors (see below), whose sum is σ = 12020037120. Its totient is φ = 10421783680.
The previous prime is 11206411133. The next prime is 11206411163. The reversal of 11206411141 is 14111460211.
11206411141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11206411141 - 23 = 11206411133 is a prime.
It is a super-2 number, since 2×112064111412 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11206411841) 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 15 ways as a sum of consecutive naturals, for example, 256020 + ... + 296578.
It is an arithmetic number, because the mean of its divisors is an integer number (751252320).
Almost surely, 211206411141 is an apocalyptic number.
It is an amenable number.
11206411141 is a deficient number, since it is larger than the sum of its proper divisors (813625979).
11206411141 is a wasteful number, since it uses less digits than its factorization.
11206411141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40916.
The product of its (nonzero) digits is 192, while the sum is 22.
Adding to 11206411141 its reverse (14111460211), we get a palindrome (25317871352).
The spelling of 11206411141 in words is "eleven billion, two hundred six million, four hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •