Base | Representation |
---|---|
bin | 11011100101010101100010… |
… | …010101101010000100001101 |
3 | 120220112102001122000211000001 |
4 | 123211111202111222010031 |
5 | 111400043011241320023 |
6 | 1110002231235404301 |
7 | 34360401154436533 |
oct | 3345254225520415 |
9 | 526472048024001 |
10 | 121313001120013 |
11 | 3572161156628a |
12 | 11733332753691 |
13 | 528c9c7bc8821 |
14 | 21d581b196153 |
15 | e05969b4e6ad |
hex | 6e556256a10d |
121313001120013 has 2 divisors, whose sum is σ = 121313001120014. Its totient is φ = 121313001120012.
The previous prime is 121313001120011. The next prime is 121313001120053. The reversal of 121313001120013 is 310021100313121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 96140123281449 + 25172877838564 = 9805107^2 + 5017258^2 .
It is a cyclic number.
It is not a de Polignac number, because 121313001120013 - 21 = 121313001120011 is a prime.
Together with 121313001120011, 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 (121313001120011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60656500560006 + 60656500560007.
It is an arithmetic number, because the mean of its divisors is an integer number (60656500560007).
Almost surely, 2121313001120013 is an apocalyptic number.
It is an amenable number.
121313001120013 is a deficient number, since it is larger than the sum of its proper divisors (1).
121313001120013 is an equidigital number, since it uses as much as digits as its factorization.
121313001120013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 121313001120013 its reverse (310021100313121), we get a palindrome (431334101433134).
The spelling of 121313001120013 in words is "one hundred twenty-one trillion, three hundred thirteen billion, one million, one hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •