Base | Representation |
---|---|
bin | 10000000000101001000… |
… | …011101000000011101101 |
3 | 10220011210212020101101211 |
4 | 100000221003220003231 |
5 | 121011202303203031 |
6 | 2201231453434421 |
7 | 142325664321541 |
oct | 20005103500355 |
9 | 3804725211354 |
10 | 1100200444141 |
11 | 394657517707 |
12 | 159286a9ba11 |
13 | 7c996489786 |
14 | 3b36dd63a21 |
15 | 1d943396bb1 |
hex | 100290e80ed |
1100200444141 has 2 divisors, whose sum is σ = 1100200444142. Its totient is φ = 1100200444140.
The previous prime is 1100200444139. The next prime is 1100200444193. The reversal of 1100200444141 is 1414440020011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 833485006116 + 266715438025 = 912954^2 + 516445^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100200444141 - 21 = 1100200444139 is a prime.
It is a super-2 number, since 2×11002004441412 (a number of 25 digits) contains 22 as substring.
Together with 1100200444139, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1100200474141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550100222070 + 550100222071.
It is an arithmetic number, because the mean of its divisors is an integer number (550100222071).
Almost surely, 21100200444141 is an apocalyptic number.
It is an amenable number.
1100200444141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100200444141 is an equidigital number, since it uses as much as digits as its factorization.
1100200444141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 1100200444141 its reverse (1414440020011), we get a palindrome (2514640464152).
The spelling of 1100200444141 in words is "one trillion, one hundred billion, two hundred million, four hundred forty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •