Base | Representation |
---|---|
bin | 10000000000101010001… |
… | …110010011010100011001 |
3 | 10220011212020001221102101 |
4 | 100000222032103110121 |
5 | 121011222311114433 |
6 | 2201233433203401 |
7 | 142326322603153 |
oct | 20005216232431 |
9 | 3804766057371 |
10 | 1100220019993 |
11 | 3946675782a6 |
12 | 159291560561 |
13 | 7c99a551b13 |
14 | 3b3727bbad3 |
15 | 1d944e6207d |
hex | 1002a393519 |
1100220019993 has 2 divisors, whose sum is σ = 1100220019994. Its totient is φ = 1100220019992.
The previous prime is 1100220019973. The next prime is 1100220020021. The reversal of 1100220019993 is 3999100220011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1085113889344 + 15106130649 = 1041688^2 + 122907^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100220019993 - 221 = 1100217922841 is a prime.
It is not a weakly prime, because it can be changed into another prime (1100220019973) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550110009996 + 550110009997.
It is an arithmetic number, because the mean of its divisors is an integer number (550110009997).
Almost surely, 21100220019993 is an apocalyptic number.
It is an amenable number.
1100220019993 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100220019993 is an equidigital number, since it uses as much as digits as its factorization.
1100220019993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8748, while the sum is 37.
The spelling of 1100220019993 in words is "one trillion, one hundred billion, two hundred twenty million, nineteen thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •