Base | Representation |
---|---|
bin | 111000011101010111… |
… | …0110110001000010101 |
3 | 102120221201210212120202 |
4 | 1300322232312020111 |
5 | 3441302034140112 |
6 | 131410545110245 |
7 | 11521356522365 |
oct | 1607256661025 |
9 | 376851725522 |
10 | 121244443157 |
11 | 47468366742 |
12 | 1b5b8628385 |
13 | b582c6c876 |
14 | 5c227249a5 |
15 | 324936e6c2 |
hex | 1c3abb6215 |
121244443157 has 2 divisors, whose sum is σ = 121244443158. Its totient is φ = 121244443156.
The previous prime is 121244443129. The next prime is 121244443163. The reversal of 121244443157 is 751344442121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103019173156 + 18225270001 = 320966^2 + 135001^2 .
It is a cyclic number.
It is not a de Polignac number, because 121244443157 - 210 = 121244442133 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121244443157.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121244443657) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60622221578 + 60622221579.
It is an arithmetic number, because the mean of its divisors is an integer number (60622221579).
Almost surely, 2121244443157 is an apocalyptic number.
It is an amenable number.
121244443157 is a deficient number, since it is larger than the sum of its proper divisors (1).
121244443157 is an equidigital number, since it uses as much as digits as its factorization.
121244443157 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 107520, while the sum is 38.
Adding to 121244443157 its reverse (751344442121), we get a palindrome (872588885278).
The spelling of 121244443157 in words is "one hundred twenty-one billion, two hundred forty-four million, four hundred forty-three thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •