Base | Representation |
---|---|
bin | 101010011100… |
… | …011110111001 |
3 | 202221021222111 |
4 | 222130132321 |
5 | 10322023323 |
6 | 1034252321 |
7 | 163401253 |
oct | 52343671 |
9 | 22837874 |
10 | 11126713 |
11 | 630a734 |
12 | 38870a1 |
13 | 23c7670 |
14 | 1698cd3 |
15 | e9bc0d |
hex | a9c7b9 |
11126713 has 4 divisors (see below), whose sum is σ = 11982628. Its totient is φ = 10270800.
The previous prime is 11126701. The next prime is 11126803. The reversal of 11126713 is 31762111.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31762111 = 1999 ⋅15889.
It can be written as a sum of positive squares in 2 ways, for example, as 5212089 + 5914624 = 2283^2 + 2432^2 .
It is a cyclic number.
It is not a de Polignac number, because 11126713 - 25 = 11126681 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11126113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 427938 + ... + 427963.
It is an arithmetic number, because the mean of its divisors is an integer number (2995657).
Almost surely, 211126713 is an apocalyptic number.
11126713 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11126713 is a deficient number, since it is larger than the sum of its proper divisors (855915).
11126713 is an equidigital number, since it uses as much as digits as its factorization.
11126713 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 855914.
The product of its digits is 252, while the sum is 22.
The square root of 11126713 is about 3335.6727957040. The cubic root of 11126713 is about 223.2487120314.
Adding to 11126713 its reverse (31762111), we get a palindrome (42888824).
The spelling of 11126713 in words is "eleven million, one hundred twenty-six thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •