Base | Representation |
---|---|
bin | 10101000011000100… |
… | …00101000111011101 |
3 | 1002011111221111011201 |
4 | 22201202011013131 |
5 | 141120300001341 |
6 | 5105142115501 |
7 | 550011263026 |
oct | 124142050735 |
9 | 32144844151 |
10 | 11300000221 |
11 | 4879612464 |
12 | 223441bb91 |
13 | 10b1125583 |
14 | 792a83c4d |
15 | 46209d331 |
hex | 2a18851dd |
11300000221 has 2 divisors, whose sum is σ = 11300000222. Its totient is φ = 11300000220.
The previous prime is 11300000219. The next prime is 11300000227. The reversal of 11300000221 is 12200000311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6085716121 + 5214284100 = 78011^2 + 72210^2 .
It is an emirp because it is prime and its reverse (12200000311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11300000221 - 21 = 11300000219 is a prime.
Together with 11300000219, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 11300000198 and 11300000207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11300000227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5650000110 + 5650000111.
It is an arithmetic number, because the mean of its divisors is an integer number (5650000111).
Almost surely, 211300000221 is an apocalyptic number.
It is an amenable number.
11300000221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11300000221 is an equidigital number, since it uses as much as digits as its factorization.
11300000221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 11300000221 its reverse (12200000311), we get a palindrome (23500000532).
The spelling of 11300000221 in words is "eleven billion, three hundred million, two hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •