Base | Representation |
---|---|
bin | 10100101110111011… |
… | …10111000000110110 |
3 | 1001201202011120102100 |
4 | 22113131313000312 |
5 | 140244031343333 |
6 | 5040310322530 |
7 | 542560654623 |
oct | 122735670066 |
9 | 31652146370 |
10 | 11131121718 |
11 | 47a2256552 |
12 | 21a7959446 |
13 | 1085146872 |
14 | 77848334a |
15 | 452340213 |
hex | 297777036 |
11131121718 has 24 divisors (see below), whose sum is σ = 24150632688. Its totient is φ = 3705265872.
The previous prime is 11131121713. The next prime is 11131121731. The reversal of 11131121718 is 81712113111.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 11131121691 and 11131121700.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11131121713) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 412221 + ... + 438392.
It is an arithmetic number, because the mean of its divisors is an integer number (1006276362).
Almost surely, 211131121718 is an apocalyptic number.
11131121718 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
11131121718 is an abundant number, since it is smaller than the sum of its proper divisors (13019510970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11131121718 is a wasteful number, since it uses less digits than its factorization.
11131121718 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 851348 (or 851345 counting only the distinct ones).
The product of its digits is 336, while the sum is 27.
Adding to 11131121718 its reverse (81712113111), we get a palindrome (92843234829).
The spelling of 11131121718 in words is "eleven billion, one hundred thirty-one million, one hundred twenty-one thousand, seven hundred eighteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •