Base | Representation |
---|---|
bin | 111000010110000111… |
… | …0100100101011111101 |
3 | 102120022202220212101011 |
4 | 1300230032210223331 |
5 | 3440302240231302 |
6 | 131330453315221 |
7 | 11512343253232 |
oct | 1605416445375 |
9 | 376282825334 |
10 | 121001102077 |
11 | 47352a70a09 |
12 | 1b54b035b11 |
13 | b54471c06b |
14 | 5bdc29d789 |
15 | 3232d035d7 |
hex | 1c2c3a4afd |
121001102077 has 2 divisors, whose sum is σ = 121001102078. Its totient is φ = 121001102076.
The previous prime is 121001101981. The next prime is 121001102099. The reversal of 121001102077 is 770201100121.
It is an a-pointer prime, because the next prime (121001102099) can be obtained adding 121001102077 to its sum of digits (22).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 61649910436 + 59351191641 = 248294^2 + 243621^2 .
It is an emirp because it is prime and its reverse (770201100121) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121001102077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121001102177) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60500551038 + 60500551039.
It is an arithmetic number, because the mean of its divisors is an integer number (60500551039).
Almost surely, 2121001102077 is an apocalyptic number.
It is an amenable number.
121001102077 is a deficient number, since it is larger than the sum of its proper divisors (1).
121001102077 is an equidigital number, since it uses as much as digits as its factorization.
121001102077 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 196, while the sum is 22.
Adding to 121001102077 its reverse (770201100121), we get a palindrome (891202202198).
The spelling of 121001102077 in words is "one hundred twenty-one billion, one million, one hundred two thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •