Base | Representation |
---|---|
bin | 11011100110101001011111… |
… | …110100111110111001001111 |
3 | 120220212000202111021202010222 |
4 | 123212221133310332321033 |
5 | 111403032124222011414 |
6 | 1110111501054021555 |
7 | 34400042212436501 |
oct | 3346513764767117 |
9 | 526760674252128 |
10 | 121403153313359 |
11 | 357568740874a5 |
12 | 117488b24a78bb |
13 | 5298364407128 |
14 | 21d9d3038dd71 |
15 | e07e9454068e |
hex | 6e6a5fd3ee4f |
121403153313359 has 2 divisors, whose sum is σ = 121403153313360. Its totient is φ = 121403153313358.
The previous prime is 121403153313313. The next prime is 121403153313361. The reversal of 121403153313359 is 953313351304121.
It is a strong prime.
It is an emirp because it is prime and its reverse (953313351304121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121403153313359 - 228 = 121402884877903 is a prime.
Together with 121403153313361, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121403153313259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60701576656679 + 60701576656680.
It is an arithmetic number, because the mean of its divisors is an integer number (60701576656680).
Almost surely, 2121403153313359 is an apocalyptic number.
121403153313359 is a deficient number, since it is larger than the sum of its proper divisors (1).
121403153313359 is an equidigital number, since it uses as much as digits as its factorization.
121403153313359 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 437400, while the sum is 44.
The spelling of 121403153313359 in words is "one hundred twenty-one trillion, four hundred three billion, one hundred fifty-three million, three hundred thirteen thousand, three hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •