Base | Representation |
---|---|
bin | 111000010111010100… |
… | …0000100011100010101 |
3 | 102120102120122011200022 |
4 | 1300232220010130111 |
5 | 3440343040341211 |
6 | 131334451554525 |
7 | 11513342262416 |
oct | 1605650043425 |
9 | 376376564608 |
10 | 121041340181 |
11 | 47373754443 |
12 | 1b5605bba45 |
13 | b54cb6a0a8 |
14 | 5c0377580d |
15 | 3236600bdb |
hex | 1c2ea04715 |
121041340181 has 2 divisors, whose sum is σ = 121041340182. Its totient is φ = 121041340180.
The previous prime is 121041340159. The next prime is 121041340247. The reversal of 121041340181 is 181043140121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 78394960081 + 42646380100 = 279991^2 + 206510^2 .
It is an emirp because it is prime and its reverse (181043140121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121041340181 - 210 = 121041339157 is a prime.
It is a super-2 number, since 2×1210413401812 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 121041340181.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121041340111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60520670090 + 60520670091.
It is an arithmetic number, because the mean of its divisors is an integer number (60520670091).
Almost surely, 2121041340181 is an apocalyptic number.
It is an amenable number.
121041340181 is a deficient number, since it is larger than the sum of its proper divisors (1).
121041340181 is an equidigital number, since it uses as much as digits as its factorization.
121041340181 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 768, while the sum is 26.
The spelling of 121041340181 in words is "one hundred twenty-one billion, forty-one million, three hundred forty thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •