Base | Representation |
---|---|
bin | 111000100000001101… |
… | …1110101100100110001 |
3 | 102121012101211221020222 |
4 | 1301000123311210301 |
5 | 3442001032422231 |
6 | 131424243542425 |
7 | 11523631013555 |
oct | 1610033654461 |
9 | 377171757228 |
10 | 121340123441 |
11 | 47507377759 |
12 | 1b62468aa15 |
13 | b599a30114 |
14 | 5c3130d865 |
15 | 325296e27b |
hex | 1c406f5931 |
121340123441 has 2 divisors, whose sum is σ = 121340123442. Its totient is φ = 121340123440.
The previous prime is 121340123417. The next prime is 121340123447. The reversal of 121340123441 is 144321043121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 116756156416 + 4583967025 = 341696^2 + 67705^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121340123441 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121340123441.
It is not a weakly prime, because it can be changed into another prime (121340123447) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60670061720 + 60670061721.
It is an arithmetic number, because the mean of its divisors is an integer number (60670061721).
Almost surely, 2121340123441 is an apocalyptic number.
It is an amenable number.
121340123441 is a deficient number, since it is larger than the sum of its proper divisors (1).
121340123441 is an equidigital number, since it uses as much as digits as its factorization.
121340123441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 121340123441 its reverse (144321043121), we get a palindrome (265661166562).
The spelling of 121340123441 in words is "one hundred twenty-one billion, three hundred forty million, one hundred twenty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •