Base | Representation |
---|---|
bin | 1011000001011110111110… |
… | …0101000011011110100101 |
3 | 1120220200011011012122012002 |
4 | 2300113233211003132211 |
5 | 3042034002241211323 |
6 | 41435523545535045 |
7 | 2360435632652633 |
oct | 260275745033645 |
9 | 46820134178162 |
10 | 12120122210213 |
11 | 395312a0202a6 |
12 | 1438b644a4485 |
13 | 69bbcbcc5b94 |
14 | 2dc88d258353 |
15 | 1604139b6828 |
hex | b05ef9437a5 |
12120122210213 has 2 divisors, whose sum is σ = 12120122210214. Its totient is φ = 12120122210212.
The previous prime is 12120122210201. The next prime is 12120122210269. The reversal of 12120122210213 is 31201222102121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6903109900129 + 5217012310084 = 2627377^2 + 2284078^2 .
It is an emirp because it is prime and its reverse (31201222102121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12120122210213 - 218 = 12120121948069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12120122218213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6060061105106 + 6060061105107.
It is an arithmetic number, because the mean of its divisors is an integer number (6060061105107).
Almost surely, 212120122210213 is an apocalyptic number.
It is an amenable number.
12120122210213 is a deficient number, since it is larger than the sum of its proper divisors (1).
12120122210213 is an equidigital number, since it uses as much as digits as its factorization.
12120122210213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 12120122210213 its reverse (31201222102121), we get a palindrome (43321344312334).
The spelling of 12120122210213 in words is "twelve trillion, one hundred twenty billion, one hundred twenty-two million, two hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •