Base | Representation |
---|---|
bin | 101010011101… |
… | …010111001001 |
3 | 202221110220211 |
4 | 222131113021 |
5 | 10322132223 |
6 | 1034321121 |
7 | 163414615 |
oct | 52352711 |
9 | 22843824 |
10 | 11130313 |
11 | 6312407 |
12 | 38891a1 |
13 | 23c91ac |
14 | 169a345 |
15 | e9cd0d |
hex | a9d5c9 |
11130313 has 2 divisors, whose sum is σ = 11130314. Its totient is φ = 11130312.
The previous prime is 11130299. The next prime is 11130323. The reversal of 11130313 is 31303111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9048064 + 2082249 = 3008^2 + 1443^2 .
It is a cyclic number.
It is not a de Polignac number, because 11130313 - 25 = 11130281 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11130293 and 11130302.
It is not a weakly prime, because it can be changed into another prime (11130323) 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, 5565156 + 5565157.
It is an arithmetic number, because the mean of its divisors is an integer number (5565157).
Almost surely, 211130313 is an apocalyptic number.
It is an amenable number.
11130313 is a deficient number, since it is larger than the sum of its proper divisors (1).
11130313 is an equidigital number, since it uses as much as digits as its factorization.
11130313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 13.
The square root of 11130313 is about 3336.2123733360. The cubic root of 11130313 is about 223.2727864878.
Adding to 11130313 its reverse (31303111), we get a palindrome (42433424).
The spelling of 11130313 in words is "eleven million, one hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •