Base | Representation |
---|---|
bin | 11011100101010010110101… |
… | …100110010010000110110101 |
3 | 120220112010120122202002002221 |
4 | 123211102311212102012311 |
5 | 111400021042333114312 |
6 | 1110001031511202341 |
7 | 34360236304131325 |
oct | 3345226546220665 |
9 | 526463518662087 |
10 | 121310103019957 |
11 | 35720364674875 |
12 | 117328640763b1 |
13 | 528c655671817 |
14 | 21d5624317285 |
15 | e0584a4d8207 |
hex | 6e54b59921b5 |
121310103019957 has 2 divisors, whose sum is σ = 121310103019958. Its totient is φ = 121310103019956.
The previous prime is 121310103019921. The next prime is 121310103019961. The reversal of 121310103019957 is 759910301013121.
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., 109636940626756 + 11673162393201 = 10470766^2 + 3416601^2 .
It is a cyclic number.
It is not a de Polignac number, because 121310103019957 - 219 = 121310102495669 is a prime.
It is a super-2 number, since 2×1213101030199572 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121310103019907) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60655051509978 + 60655051509979.
It is an arithmetic number, because the mean of its divisors is an integer number (60655051509979).
Almost surely, 2121310103019957 is an apocalyptic number.
It is an amenable number.
121310103019957 is a deficient number, since it is larger than the sum of its proper divisors (1).
121310103019957 is an equidigital number, since it uses as much as digits as its factorization.
121310103019957 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 51030, while the sum is 43.
The spelling of 121310103019957 in words is "one hundred twenty-one trillion, three hundred ten billion, one hundred three million, nineteen thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •