Base | Representation |
---|---|
bin | 11011010101010100001010… |
… | …001110001110101010110001 |
3 | 120202122011012202011100201022 |
4 | 123111110022032032222301 |
5 | 111224023144323300001 |
6 | 1103400345135345225 |
7 | 34215013462214201 |
oct | 3325241216165261 |
9 | 522564182140638 |
10 | 120212011150001 |
11 | 3533769a412161 |
12 | 11595a87382215 |
13 | 520cc36cb57a4 |
14 | 2198414432401 |
15 | dd6ecc2ee11b |
hex | 6d550a38eab1 |
120212011150001 has 2 divisors, whose sum is σ = 120212011150002. Its totient is φ = 120212011150000.
The previous prime is 120212011149943. The next prime is 120212011150043. The reversal of 120212011150001 is 100051110212021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 70656380890225 + 49555630259776 = 8405735^2 + 7039576^2 .
It is a cyclic number.
It is not a de Polignac number, because 120212011150001 - 234 = 120194831280817 is a prime.
It is not a weakly prime, because it can be changed into another prime (120212011150201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60106005575000 + 60106005575001.
It is an arithmetic number, because the mean of its divisors is an integer number (60106005575001).
Almost surely, 2120212011150001 is an apocalyptic number.
It is an amenable number.
120212011150001 is a deficient number, since it is larger than the sum of its proper divisors (1).
120212011150001 is an equidigital number, since it uses as much as digits as its factorization.
120212011150001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40, while the sum is 17.
Adding to 120212011150001 its reverse (100051110212021), we get a palindrome (220263121362022).
The spelling of 120212011150001 in words is "one hundred twenty trillion, two hundred twelve billion, eleven million, one hundred fifty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •