Base | Representation |
---|---|
bin | 11011100101010011111000… |
… | …001111111011001000000101 |
3 | 120220112020110120212010211201 |
4 | 123211103320033323020011 |
5 | 111400030340113412013 |
6 | 1110001334454302501 |
7 | 34360306102566202 |
oct | 3345237017731005 |
9 | 526466416763751 |
10 | 121311221232133 |
11 | 35720888899169 |
12 | 11732b16657a31 |
13 | 528c7a322ac2a |
14 | 21d56cca36ca9 |
15 | e058b376a3dd |
hex | 6e54f83fb205 |
121311221232133 has 2 divisors, whose sum is σ = 121311221232134. Its totient is φ = 121311221232132.
The previous prime is 121311221232121. The next prime is 121311221232137. The reversal of 121311221232133 is 331232122113121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105296801984929 + 16014419247204 = 10261423^2 + 4001802^2 .
It is a cyclic number.
It is not a de Polignac number, because 121311221232133 - 233 = 121302631297541 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121311221232137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60655610616066 + 60655610616067.
It is an arithmetic number, because the mean of its divisors is an integer number (60655610616067).
Almost surely, 2121311221232133 is an apocalyptic number.
It is an amenable number.
121311221232133 is a deficient number, since it is larger than the sum of its proper divisors (1).
121311221232133 is an equidigital number, since it uses as much as digits as its factorization.
121311221232133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2592, while the sum is 28.
Adding to 121311221232133 its reverse (331232122113121), we get a palindrome (452543343345254).
The spelling of 121311221232133 in words is "one hundred twenty-one trillion, three hundred eleven billion, two hundred twenty-one million, two hundred thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •