Base | Representation |
---|---|
bin | 10100101101000001… |
… | …11001010010101001 |
3 | 1001200122002121222200 |
4 | 22112200321102221 |
5 | 140230433442030 |
6 | 5034540010413 |
7 | 542305063515 |
oct | 122640712251 |
9 | 31618077880 |
10 | 11115140265 |
11 | 4794230439 |
12 | 21a2530a09 |
13 | 1081a3c598 |
14 | 7762c3145 |
15 | 450c34d60 |
hex | 2968394a9 |
11115140265 has 24 divisors (see below), whose sum is σ = 19278255048. Its totient is φ = 5924378880.
The previous prime is 11115140263. The next prime is 11115140273. The reversal of 11115140265 is 56204151111.
It can be written as a sum of positive squares in 4 ways, for example, as 2430391401 + 8684748864 = 49299^2 + 93192^2 .
It is not a de Polignac number, because 11115140265 - 21 = 11115140263 is a prime.
It is a super-2 number, since 2×111151402652 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11115140263) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3244 + ... + 149133.
It is an arithmetic number, because the mean of its divisors is an integer number (803260627).
Almost surely, 211115140265 is an apocalyptic number.
11115140265 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11115140265 is a deficient number, since it is larger than the sum of its proper divisors (8163114783).
11115140265 is a wasteful number, since it uses less digits than its factorization.
11115140265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154009 (or 154006 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 27.
Adding to 11115140265 its reverse (56204151111), we get a palindrome (67319291376).
The spelling of 11115140265 in words is "eleven billion, one hundred fifteen million, one hundred forty thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •