Base | Representation |
---|---|
bin | 100000000001111101001… |
… | …010010110011111101101 |
3 | 21210102111001111000000111 |
4 | 200001331022112133231 |
5 | 242030400004334013 |
6 | 4403103151300021 |
7 | 315011611553506 |
oct | 40017512263755 |
9 | 7712431430014 |
10 | 2201123121133 |
11 | 779544689572 |
12 | 2b671381a611 |
13 | 12c74646b161 |
14 | 7876bbabbad |
15 | 3c3c9d5373d |
hex | 2007d2967ed |
2201123121133 has 2 divisors, whose sum is σ = 2201123121134. Its totient is φ = 2201123121132.
The previous prime is 2201123121107. The next prime is 2201123121139. The reversal of 2201123121133 is 3311213211022.
2201123121133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2120104899364 + 81018221769 = 1456058^2 + 284637^2 .
It is a cyclic number.
It is not a de Polignac number, because 2201123121133 - 217 = 2201122990061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2201123121139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1100561560566 + 1100561560567.
It is an arithmetic number, because the mean of its divisors is an integer number (1100561560567).
Almost surely, 22201123121133 is an apocalyptic number.
It is an amenable number.
2201123121133 is a deficient number, since it is larger than the sum of its proper divisors (1).
2201123121133 is an equidigital number, since it uses as much as digits as its factorization.
2201123121133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 2201123121133 its reverse (3311213211022), we get a palindrome (5512336332155).
The spelling of 2201123121133 in words is "two trillion, two hundred one billion, one hundred twenty-three million, one hundred twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •