Base | Representation |
---|---|
bin | 11011100101101101000011… |
… | …110101011011111101010101 |
3 | 120220121211020220111020101111 |
4 | 123211231003311123331111 |
5 | 111401001223321122132 |
6 | 1110022005435055021 |
7 | 34362254114313001 |
oct | 3345550365337525 |
9 | 526554226436344 |
10 | 121338259160917 |
11 | 357312a3018257 |
12 | 117382015a1471 |
13 | 52921c1a2b666 |
14 | 21d6b3590d701 |
15 | e064472e3647 |
hex | 6e5b43d5bf55 |
121338259160917 has 2 divisors, whose sum is σ = 121338259160918. Its totient is φ = 121338259160916.
The previous prime is 121338259160873. The next prime is 121338259161013. The reversal of 121338259160917 is 719061952833121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111778728922116 + 9559530238801 = 10572546^2 + 3091849^2 .
It is a cyclic number.
It is not a de Polignac number, because 121338259160917 - 211 = 121338259158869 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121338250160917) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60669129580458 + 60669129580459.
It is an arithmetic number, because the mean of its divisors is an integer number (60669129580459).
Almost surely, 2121338259160917 is an apocalyptic number.
It is an amenable number.
121338259160917 is a deficient number, since it is larger than the sum of its proper divisors (1).
121338259160917 is an equidigital number, since it uses as much as digits as its factorization.
121338259160917 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4898880, while the sum is 58.
The spelling of 121338259160917 in words is "one hundred twenty-one trillion, three hundred thirty-eight billion, two hundred fifty-nine million, one hundred sixty thousand, nine hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •