Base | Representation |
---|---|
bin | 10000000011010001000… |
… | …111110011010101101011 |
3 | 10220110002100221022110112 |
4 | 100003101013303111223 |
5 | 121032441122024321 |
6 | 2202415341004535 |
7 | 142455603151334 |
oct | 20032107632553 |
9 | 3813070838415 |
10 | 1103020111211 |
11 | 395874108277 |
12 | 15993325374b |
13 | 800256b1725 |
14 | 3b55a62728b |
15 | 1da5abb8a5b |
hex | 100d11f356b |
1103020111211 has 8 divisors (see below), whose sum is σ = 1105728646464. Its totient is φ = 1100313058120.
The previous prime is 1103020111177. The next prime is 1103020111217. The reversal of 1103020111211 is 1121110203011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1103020111211 is a prime.
It is a super-3 number, since 3×11030201112113 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1103020111217) 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 in 7 ways as a sum of consecutive naturals, for example, 1127096 + ... + 1864506.
It is an arithmetic number, because the mean of its divisors is an integer number (138216080808).
Almost surely, 21103020111211 is an apocalyptic number.
1103020111211 is a deficient number, since it is larger than the sum of its proper divisors (2708535253).
1103020111211 is an equidigital number, since it uses as much as digits as its factorization.
1103020111211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 741081.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 1103020111211 its reverse (1121110203011), we get a palindrome (2224130314222).
The spelling of 1103020111211 in words is "one trillion, one hundred three billion, twenty million, one hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •