Base | Representation |
---|---|
bin | 10100101110110100… |
… | …10110000010011011 |
3 | 1001201200102202100202 |
4 | 22113122112002123 |
5 | 140243312401334 |
6 | 5040234452415 |
7 | 542550066215 |
oct | 122732260233 |
9 | 31650382322 |
10 | 11130200219 |
11 | 47a1787186 |
12 | 21a759410b |
13 | 1084bb32b8 |
14 | 7782c35b5 |
15 | 45220c17e |
hex | 29769609b |
11130200219 has 2 divisors, whose sum is σ = 11130200220. Its totient is φ = 11130200218.
The previous prime is 11130200189. The next prime is 11130200233. The reversal of 11130200219 is 91200203111.
11130200219 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (91200203111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11130200219 - 224 = 11113423003 is a prime.
It is a super-2 number, since 2×111302002192 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11130200219.
It is not a weakly prime, because it can be changed into another prime (11130200119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5565100109 + 5565100110.
It is an arithmetic number, because the mean of its divisors is an integer number (5565100110).
Almost surely, 211130200219 is an apocalyptic number.
11130200219 is a deficient number, since it is larger than the sum of its proper divisors (1).
11130200219 is an equidigital number, since it uses as much as digits as its factorization.
11130200219 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 20.
The spelling of 11130200219 in words is "eleven billion, one hundred thirty million, two hundred thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •