Base | Representation |
---|---|
bin | 111000011001000110… |
… | …0001110101110010001 |
3 | 102120120202011212212022 |
4 | 1300302030032232101 |
5 | 3441003343313441 |
6 | 131344425541225 |
7 | 11514666541346 |
oct | 1606214165621 |
9 | 376522155768 |
10 | 121101151121 |
11 | 473a4496275 |
12 | 1b578644815 |
13 | b55c37bc92 |
14 | 5c0b6a47cd |
15 | 323b9b784b |
hex | 1c3230eb91 |
121101151121 has 2 divisors, whose sum is σ = 121101151122. Its totient is φ = 121101151120.
The previous prime is 121101151063. The next prime is 121101151147. The reversal of 121101151121 is 121151101121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 79602979600 + 41498171521 = 282140^2 + 203711^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121101151121 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121101151121.
It is not a weakly prime, because it can be changed into another prime (121101151321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60550575560 + 60550575561.
It is an arithmetic number, because the mean of its divisors is an integer number (60550575561).
Almost surely, 2121101151121 is an apocalyptic number.
It is an amenable number.
121101151121 is a deficient number, since it is larger than the sum of its proper divisors (1).
121101151121 is an equidigital number, since it uses as much as digits as its factorization.
121101151121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20, while the sum is 17.
Adding to 121101151121 its reverse (121151101121), we get a palindrome (242252252242).
The spelling of 121101151121 in words is "one hundred twenty-one billion, one hundred one million, one hundred fifty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •