Base | Representation |
---|---|
bin | 111000011111000101… |
… | …0111010010110010001 |
3 | 102121002202100202221202 |
4 | 1300332022322112101 |
5 | 3441411321211423 |
6 | 131420405400545 |
7 | 11522660052641 |
oct | 1607612722621 |
9 | 377082322852 |
10 | 121302132113 |
11 | 47497989268 |
12 | 1b613a09155 |
13 | b591bba946 |
14 | 5c2a260521 |
15 | 324e467728 |
hex | 1c3e2ba591 |
121302132113 has 2 divisors, whose sum is σ = 121302132114. Its totient is φ = 121302132112.
The previous prime is 121302132059. The next prime is 121302132167. The reversal of 121302132113 is 311231203121.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (121302132059) and next prime (121302132167).
It can be written as a sum of positive squares in only one way, i.e., 102561343504 + 18740788609 = 320252^2 + 136897^2 .
It is a cyclic number.
It is not a de Polignac number, because 121302132113 - 234 = 104122262929 is a prime.
It is not a weakly prime, because it can be changed into another prime (121302132013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60651066056 + 60651066057.
It is an arithmetic number, because the mean of its divisors is an integer number (60651066057).
Almost surely, 2121302132113 is an apocalyptic number.
It is an amenable number.
121302132113 is a deficient number, since it is larger than the sum of its proper divisors (1).
121302132113 is an equidigital number, since it uses as much as digits as its factorization.
121302132113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 121302132113 its reverse (311231203121), we get a palindrome (432533335234).
The spelling of 121302132113 in words is "one hundred twenty-one billion, three hundred two million, one hundred thirty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •