Base | Representation |
---|---|
bin | 1010001100000011011110… |
… | …1111110111000101000011 |
3 | 1110122220212021110001112211 |
4 | 2203000313233313011003 |
5 | 2432014111230014334 |
6 | 35454120233402551 |
7 | 2234222130632506 |
oct | 243006757670503 |
9 | 43586767401484 |
10 | 11202210001219 |
11 | 36299155607a6 |
12 | 130b091569457 |
13 | 633496566b53 |
14 | 2aa292d7913d |
15 | 1465ddb73a64 |
hex | a3037bf7143 |
11202210001219 has 2 divisors, whose sum is σ = 11202210001220. Its totient is φ = 11202210001218.
The previous prime is 11202210001201. The next prime is 11202210001259. The reversal of 11202210001219 is 91210001220211.
It is a weak prime.
It is an emirp because it is prime and its reverse (91210001220211) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11202210001219 is a prime.
It is a super-2 number, since 2×112022100012192 (a number of 27 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 11202210001219.
It is not a weakly prime, because it can be changed into another prime (11202210001259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5601105000609 + 5601105000610.
It is an arithmetic number, because the mean of its divisors is an integer number (5601105000610).
Almost surely, 211202210001219 is an apocalyptic number.
11202210001219 is a deficient number, since it is larger than the sum of its proper divisors (1).
11202210001219 is an equidigital number, since it uses as much as digits as its factorization.
11202210001219 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 11202210001219 in words is "eleven trillion, two hundred two billion, two hundred ten million, one thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •