Base | Representation |
---|---|
bin | 11011100010110110011001… |
… | …111000001010100111010111 |
3 | 120212221002000121211000100221 |
4 | 123202312121320022213113 |
5 | 111334243042330040041 |
6 | 1105351532253015211 |
7 | 34342142005656022 |
oct | 3342663170124727 |
9 | 525832017730327 |
10 | 121142134221271 |
11 | 356660aa665279 |
12 | 117061a7784507 |
13 | 5279867497807 |
14 | 21cb44c33c1b9 |
15 | e012b91652d1 |
hex | 6e2d99e0a9d7 |
121142134221271 has 2 divisors, whose sum is σ = 121142134221272. Its totient is φ = 121142134221270.
The previous prime is 121142134221209. The next prime is 121142134221439. The reversal of 121142134221271 is 172122431241121.
It is a weak prime.
It is an emirp because it is prime and its reverse (172122431241121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121142134221271 - 227 = 121142000003543 is a prime.
It is a super-3 number, since 3×1211421342212713 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121142134222271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60571067110635 + 60571067110636.
It is an arithmetic number, because the mean of its divisors is an integer number (60571067110636).
Almost surely, 2121142134221271 is an apocalyptic number.
121142134221271 is a deficient number, since it is larger than the sum of its proper divisors (1).
121142134221271 is an equidigital number, since it uses as much as digits as its factorization.
121142134221271 is an evil number, because the sum of its binary digits is even.
The product of its digits is 10752, while the sum is 34.
Adding to 121142134221271 its reverse (172122431241121), we get a palindrome (293264565462392).
The spelling of 121142134221271 in words is "one hundred twenty-one trillion, one hundred forty-two billion, one hundred thirty-four million, two hundred twenty-one thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •