Base | Representation |
---|---|
bin | 111000100000001110… |
… | …0111010001001101101 |
3 | 102121012102101012120101 |
4 | 1301000130322021231 |
5 | 3442001120414313 |
6 | 131424253551101 |
7 | 11523633263521 |
oct | 1610034721155 |
9 | 377172335511 |
10 | 121340404333 |
11 | 475075497a5 |
12 | 1b6247a5491 |
13 | b599acac25 |
14 | 5c31383d81 |
15 | 32529c75dd |
hex | 1c4073a26d |
121340404333 has 2 divisors, whose sum is σ = 121340404334. Its totient is φ = 121340404332.
The previous prime is 121340404313. The next prime is 121340404351. The reversal of 121340404333 is 333404043121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97505058564 + 23835345769 = 312258^2 + 154387^2 .
It is an emirp because it is prime and its reverse (333404043121) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121340404333 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121340404313) 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, 60670202166 + 60670202167.
It is an arithmetic number, because the mean of its divisors is an integer number (60670202167).
Almost surely, 2121340404333 is an apocalyptic number.
It is an amenable number.
121340404333 is a deficient number, since it is larger than the sum of its proper divisors (1).
121340404333 is an equidigital number, since it uses as much as digits as its factorization.
121340404333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 121340404333 its reverse (333404043121), we get a palindrome (454744447454).
The spelling of 121340404333 in words is "one hundred twenty-one billion, three hundred forty million, four hundred four thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •