Base | Representation |
---|---|
bin | 11011100001010000000111… |
… | …111110000110101111100101 |
3 | 120212112120112221011100101101 |
4 | 123201100013332012233211 |
5 | 111330443133400403331 |
6 | 1105225250540200101 |
7 | 34331203344352414 |
oct | 3341200776065745 |
9 | 525476487140341 |
10 | 121032312122341 |
11 | 35623573983944 |
12 | 116a8a58539031 |
13 | 526c3b4ab8319 |
14 | 21c5dd0a2747b |
15 | ded4dc9ae061 |
hex | 6e1407f86be5 |
121032312122341 has 2 divisors, whose sum is σ = 121032312122342. Its totient is φ = 121032312122340.
The previous prime is 121032312122297. The next prime is 121032312122357. The reversal of 121032312122341 is 143221213230121.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 120640655191716 + 391656930625 = 10983654^2 + 625825^2 .
It is a cyclic number.
It is not a de Polignac number, because 121032312122341 - 213 = 121032312114149 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121032412122341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60516156061170 + 60516156061171.
It is an arithmetic number, because the mean of its divisors is an integer number (60516156061171).
Almost surely, 2121032312122341 is an apocalyptic number.
It is an amenable number.
121032312122341 is a deficient number, since it is larger than the sum of its proper divisors (1).
121032312122341 is an equidigital number, since it uses as much as digits as its factorization.
121032312122341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 121032312122341 its reverse (143221213230121), we get a palindrome (264253525352462).
The spelling of 121032312122341 in words is "one hundred twenty-one trillion, thirty-two billion, three hundred twelve million, one hundred twenty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •