Base | Representation |
---|---|
bin | 10100101111001010… |
… | …11010110001101111 |
3 | 1001201212220020112010 |
4 | 22113211122301233 |
5 | 140300033300330 |
6 | 5040421012303 |
7 | 542613546603 |
oct | 122745326157 |
9 | 31655806463 |
10 | 11133103215 |
11 | 47a338a253 |
12 | 21a8554093 |
13 | 108568b750 |
14 | 77883b503 |
15 | 4525d23b0 |
hex | 29795ac6f |
11133103215 has 32 divisors (see below), whose sum is σ = 19197097920. Its totient is φ = 5476939776.
The previous prime is 11133103213. The next prime is 11133103231. The reversal of 11133103215 is 51230133111.
It is not a de Polignac number, because 11133103215 - 21 = 11133103213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11133103191 and 11133103200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11133103213) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 258679 + ... + 298631.
It is an arithmetic number, because the mean of its divisors is an integer number (599909310).
Almost surely, 211133103215 is an apocalyptic number.
11133103215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11133103215 is a deficient number, since it is larger than the sum of its proper divisors (8063994705).
11133103215 is a wasteful number, since it uses less digits than its factorization.
11133103215 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41403.
The product of its (nonzero) digits is 270, while the sum is 21.
Adding to 11133103215 its reverse (51230133111), we get a palindrome (62363236326).
The spelling of 11133103215 in words is "eleven billion, one hundred thirty-three million, one hundred three thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •