Base | Representation |
---|---|
bin | 111000011100000100… |
… | …1100001000100100001 |
3 | 102120211201020222020211 |
4 | 1300320021201010201 |
5 | 3441204440300022 |
6 | 131402400134121 |
7 | 11520322243552 |
oct | 1607011410441 |
9 | 376751228224 |
10 | 121201103137 |
11 | 47445954744 |
12 | 1b5a6007341 |
13 | b576ca699a |
14 | 5c1aa82329 |
15 | 324565ce77 |
hex | 1c38261121 |
121201103137 has 2 divisors, whose sum is σ = 121201103138. Its totient is φ = 121201103136.
The previous prime is 121201103087. The next prime is 121201103213. The reversal of 121201103137 is 731301102121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 84032733456 + 37168369681 = 289884^2 + 192791^2 .
It is a cyclic number.
It is not a de Polignac number, because 121201103137 - 211 = 121201101089 is a prime.
It is a super-2 number, since 2×1212011031372 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (121201104137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60600551568 + 60600551569.
It is an arithmetic number, because the mean of its divisors is an integer number (60600551569).
Almost surely, 2121201103137 is an apocalyptic number.
It is an amenable number.
121201103137 is a deficient number, since it is larger than the sum of its proper divisors (1).
121201103137 is an equidigital number, since it uses as much as digits as its factorization.
121201103137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 22.
Adding to 121201103137 its reverse (731301102121), we get a palindrome (852502205258).
The spelling of 121201103137 in words is "one hundred twenty-one billion, two hundred one million, one hundred three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •