Base | Representation |
---|---|
bin | 1010000001011101100001… |
… | …0011011111001001100011 |
3 | 1110000112010002100020200011 |
4 | 2200113120103133021203 |
5 | 2421023402321214334 |
6 | 35234341430305351 |
7 | 2215120220204620 |
oct | 240273023371143 |
9 | 43015102306604 |
10 | 11020220101219 |
11 | 3569715a5026a |
12 | 129b9614b8257 |
13 | 61c2825a34a4 |
14 | 2a154ab93347 |
15 | 1419db900564 |
hex | a05d84df263 |
11020220101219 has 4 divisors (see below), whose sum is σ = 12594537258544. Its totient is φ = 9445902943896.
The previous prime is 11020220101171. The next prime is 11020220101291. The reversal of 11020220101219 is 91210102202011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11020220101219 - 213 = 11020220093027 is a prime.
It is a super-2 number, since 2×110202201012192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11020220101219.
It is not an unprimeable number, because it can be changed into a prime (11020220104219) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 787158578652 + ... + 787158578665.
It is an arithmetic number, because the mean of its divisors is an integer number (3148634314636).
Almost surely, 211020220101219 is an apocalyptic number.
11020220101219 is a deficient number, since it is larger than the sum of its proper divisors (1574317157325).
11020220101219 is an equidigital number, since it uses as much as digits as its factorization.
11020220101219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1574317157324.
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 11020220101219 in words is "eleven trillion, twenty billion, two hundred twenty million, one hundred one thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •