Base | Representation |
---|---|
bin | 1011000111011010111100… |
… | …1000100101111111101101 |
3 | 1121021102102120110112022022 |
4 | 2301312233020211333231 |
5 | 3100221400234111301 |
6 | 41554433045155525 |
7 | 2401006350524504 |
oct | 261665710457755 |
9 | 47242376415268 |
10 | 12222120222701 |
11 | 3992410265794 |
12 | 145488b3bbba5 |
13 | 6a870573511c |
14 | 3037a77b783b |
15 | 162dd331ed1b |
hex | b1daf225fed |
12222120222701 has 2 divisors, whose sum is σ = 12222120222702. Its totient is φ = 12222120222700.
The previous prime is 12222120222667. The next prime is 12222120222707. The reversal of 12222120222701 is 10722202122221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11993684976100 + 228435246601 = 3463190^2 + 477949^2 .
It is an emirp because it is prime and its reverse (10722202122221) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12222120222701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12222120222707) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6111060111350 + 6111060111351.
It is an arithmetic number, because the mean of its divisors is an integer number (6111060111351).
Almost surely, 212222120222701 is an apocalyptic number.
It is an amenable number.
12222120222701 is a deficient number, since it is larger than the sum of its proper divisors (1).
12222120222701 is an equidigital number, since it uses as much as digits as its factorization.
12222120222701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1792, while the sum is 26.
Adding to 12222120222701 its reverse (10722202122221), we get a palindrome (22944322344922).
The spelling of 12222120222701 in words is "twelve trillion, two hundred twenty-two billion, one hundred twenty million, two hundred twenty-two thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •