Base | Representation |
---|---|
bin | 10000000000100011101… |
… | …000101001010111110101 |
3 | 10220011120112002012200101 |
4 | 100000203220221113311 |
5 | 121011011012014212 |
6 | 2201214444114101 |
7 | 142323511224265 |
oct | 20004350512765 |
9 | 3804515065611 |
10 | 1100109485557 |
11 | 394610141125 |
12 | 159260535931 |
13 | 7c980690424 |
14 | 3b361c477a5 |
15 | 1d93a3cb157 |
hex | 10023a295f5 |
1100109485557 has 2 divisors, whose sum is σ = 1100109485558. Its totient is φ = 1100109485556.
The previous prime is 1100109485537. The next prime is 1100109485723. The reversal of 1100109485557 is 7555849010011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 619619291281 + 480490194276 = 787159^2 + 693174^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100109485557 - 211 = 1100109483509 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1100109485537) 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, 550054742778 + 550054742779.
It is an arithmetic number, because the mean of its divisors is an integer number (550054742779).
Almost surely, 21100109485557 is an apocalyptic number.
It is an amenable number.
1100109485557 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100109485557 is an equidigital number, since it uses as much as digits as its factorization.
1100109485557 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252000, while the sum is 46.
The spelling of 1100109485557 in words is "one trillion, one hundred billion, one hundred nine million, four hundred eighty-five thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •