Base | Representation |
---|---|
bin | 101010111101… |
… | …000011010001 |
3 | 210012001222020 |
4 | 222331003101 |
5 | 10340310423 |
6 | 1041202053 |
7 | 164465214 |
oct | 52750321 |
9 | 23161866 |
10 | 11260113 |
11 | 63a0987 |
12 | 3930329 |
13 | 24432b7 |
14 | 16d177b |
15 | ec64e3 |
hex | abd0d1 |
11260113 has 4 divisors (see below), whose sum is σ = 15013488. Its totient is φ = 7506740.
The previous prime is 11260097. The next prime is 11260121. The reversal of 11260113 is 31106211.
11260113 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11260113 - 24 = 11260097 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11260092 and 11260101.
It is not an unprimeable number, because it can be changed into a prime (11260153) 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, 1876683 + ... + 1876688.
It is an arithmetic number, because the mean of its divisors is an integer number (3753372).
Almost surely, 211260113 is an apocalyptic number.
It is an amenable number.
11260113 is a deficient number, since it is larger than the sum of its proper divisors (3753375).
11260113 is an equidigital number, since it uses as much as digits as its factorization.
11260113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3753374.
The product of its (nonzero) digits is 36, while the sum is 15.
The square root of 11260113 is about 3355.6091846340. The cubic root of 11260113 is about 224.1373586211.
Adding to 11260113 its reverse (31106211), we get a palindrome (42366324).
The spelling of 11260113 in words is "eleven million, two hundred sixty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •