Base | Representation |
---|---|
bin | 11011100001001111110110… |
… | …001001110110010010111101 |
3 | 120212112112210002201001212001 |
4 | 123201033312021312102331 |
5 | 111330442030340221223 |
6 | 1105225201141342301 |
7 | 34331163054555265 |
oct | 3341176611662275 |
9 | 525475702631761 |
10 | 121032013210813 |
11 | 35623430183221 |
12 | 116a8994407991 |
13 | 526c367babab3 |
14 | 21c5da30587a5 |
15 | ded4c16179ad |
hex | 6e13f62764bd |
121032013210813 has 2 divisors, whose sum is σ = 121032013210814. Its totient is φ = 121032013210812.
The previous prime is 121032013210811. The next prime is 121032013210817. The reversal of 121032013210813 is 318012310230121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 78893245902969 + 42138767307844 = 8882187^2 + 6491438^2 .
It is a cyclic number.
It is not a de Polignac number, because 121032013210813 - 21 = 121032013210811 is a prime.
Together with 121032013210811, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121032013210811) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60516006605406 + 60516006605407.
It is an arithmetic number, because the mean of its divisors is an integer number (60516006605407).
Almost surely, 2121032013210813 is an apocalyptic number.
It is an amenable number.
121032013210813 is a deficient number, since it is larger than the sum of its proper divisors (1).
121032013210813 is an equidigital number, since it uses as much as digits as its factorization.
121032013210813 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 28.
Adding to 121032013210813 its reverse (318012310230121), we get a palindrome (439044323440934).
The spelling of 121032013210813 in words is "one hundred twenty-one trillion, thirty-two billion, thirteen million, two hundred ten thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •