Base | Representation |
---|---|
bin | 10100101110110100… |
… | …11010111100011001 |
3 | 1001201200110202220222 |
4 | 22113122122330121 |
5 | 140243314022223 |
6 | 5040235125425 |
7 | 542550211622 |
oct | 122732327431 |
9 | 31650422828 |
10 | 11130220313 |
11 | 47a17a0293 |
12 | 21a75a3875 |
13 | 1084bbc4a4 |
14 | 7782caa49 |
15 | 4522130c8 |
hex | 29769af19 |
11130220313 has 2 divisors, whose sum is σ = 11130220314. Its totient is φ = 11130220312.
The previous prime is 11130220307. The next prime is 11130220333. The reversal of 11130220313 is 31302203111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9125598784 + 2004621529 = 95528^2 + 44773^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11130220313 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 = 11130220291 and 11130220300.
It is not a weakly prime, because it can be changed into another prime (11130220333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5565110156 + 5565110157.
It is an arithmetic number, because the mean of its divisors is an integer number (5565110157).
Almost surely, 211130220313 is an apocalyptic number.
It is an amenable number.
11130220313 is a deficient number, since it is larger than the sum of its proper divisors (1).
11130220313 is an equidigital number, since it uses as much as digits as its factorization.
11130220313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 11130220313 its reverse (31302203111), we get a palindrome (42432423424).
The spelling of 11130220313 in words is "eleven billion, one hundred thirty million, two hundred twenty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •