Base | Representation |
---|---|
bin | 10100111100010001… |
… | …01001110011101011 |
3 | 1002000112200201211210 |
4 | 22132020221303223 |
5 | 141011202044430 |
6 | 5055344324203 |
7 | 545416643511 |
oct | 123610516353 |
9 | 32015621753 |
10 | 11243003115 |
11 | 484a422713 |
12 | 2219313663 |
13 | 10a238a386 |
14 | 7892884b1 |
15 | 45c0902b0 |
hex | 29e229ceb |
11243003115 has 8 divisors (see below), whose sum is σ = 17988805008. Its totient is φ = 5996268320.
The previous prime is 11243003111. The next prime is 11243003119. The reversal of 11243003115 is 51130034211.
It is an interprime number because it is at equal distance from previous prime (11243003111) and next prime (11243003119).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11243003115 - 22 = 11243003111 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11243003091 and 11243003100.
It is not an unprimeable number, because it can be changed into a prime (11243003111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 374766756 + ... + 374766785.
It is an arithmetic number, because the mean of its divisors is an integer number (2248600626).
Almost surely, 211243003115 is an apocalyptic number.
11243003115 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11243003115 is a deficient number, since it is larger than the sum of its proper divisors (6745801893).
11243003115 is an equidigital number, since it uses as much as digits as its factorization.
11243003115 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 749533549.
The product of its (nonzero) digits is 360, while the sum is 21.
Adding to 11243003115 its reverse (51130034211), we get a palindrome (62373037326).
The spelling of 11243003115 in words is "eleven billion, two hundred forty-three million, three thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •