Base | Representation |
---|---|
bin | 111000011111000010… |
… | …0110010000000000101 |
3 | 102121002122100010111022 |
4 | 1300332010302000011 |
5 | 3441410413300221 |
6 | 131420311120525 |
7 | 11522640310442 |
oct | 1607604620005 |
9 | 377078303438 |
10 | 121300525061 |
11 | 47496a90921 |
12 | 1b613373145 |
13 | b591777321 |
14 | 5c29d629c9 |
15 | 324e24b4ab |
hex | 1c3e132005 |
121300525061 has 2 divisors, whose sum is σ = 121300525062. Its totient is φ = 121300525060.
The previous prime is 121300525043. The next prime is 121300525063. The reversal of 121300525061 is 160525003121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 120604092961 + 696432100 = 347281^2 + 26390^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121300525061 is a prime.
Together with 121300525063, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121300525061.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121300525063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60650262530 + 60650262531.
It is an arithmetic number, because the mean of its divisors is an integer number (60650262531).
Almost surely, 2121300525061 is an apocalyptic number.
It is an amenable number.
121300525061 is a deficient number, since it is larger than the sum of its proper divisors (1).
121300525061 is an equidigital number, since it uses as much as digits as its factorization.
121300525061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 121300525061 its reverse (160525003121), we get a palindrome (281825528182).
The spelling of 121300525061 in words is "one hundred twenty-one billion, three hundred million, five hundred twenty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •