Base | Representation |
---|---|
bin | 10000000001011110110… |
… | …011100110111111100101 |
3 | 10220021010201002002122202 |
4 | 100001132303212333211 |
5 | 121020024131341031 |
6 | 2201501145504245 |
7 | 142360224254525 |
oct | 20013663467745 |
9 | 3807121062582 |
10 | 1101102215141 |
11 | 394a7a5495a5 |
12 | 159498aa2085 |
13 | 7caab253296 |
14 | 3b417a21685 |
15 | 1d9976232cb |
hex | 1005ece6fe5 |
1101102215141 has 2 divisors, whose sum is σ = 1101102215142. Its totient is φ = 1101102215140.
The previous prime is 1101102215111. The next prime is 1101102215159. The reversal of 1101102215141 is 1415122011011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 674157587041 + 426944628100 = 821071^2 + 653410^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101102215141 - 222 = 1101098020837 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101102215111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550551107570 + 550551107571.
It is an arithmetic number, because the mean of its divisors is an integer number (550551107571).
Almost surely, 21101102215141 is an apocalyptic number.
It is an amenable number.
1101102215141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101102215141 is an equidigital number, since it uses as much as digits as its factorization.
1101102215141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 80, while the sum is 20.
Adding to 1101102215141 its reverse (1415122011011), we get a palindrome (2516224226152).
The spelling of 1101102215141 in words is "one trillion, one hundred one billion, one hundred two million, two hundred fifteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •