Base | Representation |
---|---|
bin | 101011111011… |
… | …000100000001 |
3 | 210122222101122 |
4 | 223323010001 |
5 | 10421422423 |
6 | 1050442025 |
7 | 166603562 |
oct | 53730401 |
9 | 23588348 |
10 | 11514113 |
11 | 65547a6 |
12 | 3a33315 |
13 | 2501ab0 |
14 | 175a169 |
15 | 10268c8 |
hex | afb101 |
11514113 has 8 divisors (see below), whose sum is σ = 12800256. Its totient is φ = 10285200.
The previous prime is 11514079. The next prime is 11514127. The reversal of 11514113 is 31141511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11514113 - 218 = 11251969 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11514091 and 11514100.
It is not an unprimeable number, because it can be changed into a prime (11514143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13883 + ... + 14688.
It is an arithmetic number, because the mean of its divisors is an integer number (1600032).
Almost surely, 211514113 is an apocalyptic number.
11514113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11514113 is a deficient number, since it is larger than the sum of its proper divisors (1286143).
11514113 is a wasteful number, since it uses less digits than its factorization.
11514113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28615.
The product of its digits is 60, while the sum is 17.
The square root of 11514113 is about 3393.2452018680. The cubic root of 11514113 is about 225.8101689937.
Adding to 11514113 its reverse (31141511), we get a palindrome (42655624).
The spelling of 11514113 in words is "eleven million, five hundred fourteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •