Base | Representation |
---|---|
bin | 101010011011… |
… | …001101110001 |
3 | 202221000212012 |
4 | 222123031301 |
5 | 10321342041 |
6 | 1034212305 |
7 | 163350155 |
oct | 52331561 |
9 | 22830765 |
10 | 11121521 |
11 | 6306844 |
12 | 3884095 |
13 | 23c51a8 |
14 | 1697065 |
15 | e9a3eb |
hex | a9b371 |
11121521 has 2 divisors, whose sum is σ = 11121522. Its totient is φ = 11121520.
The previous prime is 11121503. The next prime is 11121527. The reversal of 11121521 is 12512111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6451600 + 4669921 = 2540^2 + 2161^2 .
It is an emirp because it is prime and its reverse (12512111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11121521 - 26 = 11121457 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11121496 and 11121505.
It is not a weakly prime, because it can be changed into another prime (11121527) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560760 + 5560761.
It is an arithmetic number, because the mean of its divisors is an integer number (5560761).
Almost surely, 211121521 is an apocalyptic number.
It is an amenable number.
11121521 is a deficient number, since it is larger than the sum of its proper divisors (1).
11121521 is an equidigital number, since it uses as much as digits as its factorization.
11121521 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 20, while the sum is 14.
The square root of 11121521 is about 3334.8944511034. The cubic root of 11121521 is about 223.2139821686.
Adding to 11121521 its reverse (12512111), we get a palindrome (23633632).
The spelling of 11121521 in words is "eleven million, one hundred twenty-one thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •