Base | Representation |
---|---|
bin | 11011100000110100001011… |
… | …111001000000000011011101 |
3 | 120212102201010020202020022011 |
4 | 123200310023321000003131 |
5 | 111330000214124401023 |
6 | 1105203410101351221 |
7 | 34326062056146151 |
oct | 3340641371000335 |
9 | 525381106666264 |
10 | 121002313122013 |
11 | 3561187a262994 |
12 | 116a3085a08511 |
13 | 52696139b325b |
14 | 21c478679d061 |
15 | dec833ed150d |
hex | 6e0d0be400dd |
121002313122013 has 2 divisors, whose sum is σ = 121002313122014. Its totient is φ = 121002313122012.
The previous prime is 121002313122011. The next prime is 121002313122077. The reversal of 121002313122013 is 310221313200121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 106393077348804 + 14609235773209 = 10314702^2 + 3822203^2 .
It is a cyclic number.
It is not a de Polignac number, because 121002313122013 - 21 = 121002313122011 is a prime.
Together with 121002313122011, 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 (121002313122011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60501156561006 + 60501156561007.
It is an arithmetic number, because the mean of its divisors is an integer number (60501156561007).
Almost surely, 2121002313122013 is an apocalyptic number.
It is an amenable number.
121002313122013 is a deficient number, since it is larger than the sum of its proper divisors (1).
121002313122013 is an equidigital number, since it uses as much as digits as its factorization.
121002313122013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 121002313122013 its reverse (310221313200121), we get a palindrome (431223626322134).
The spelling of 121002313122013 in words is "one hundred twenty-one trillion, two billion, three hundred thirteen million, one hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •