Base | Representation |
---|---|
bin | 1010111010100111101011… |
… | …1111100110111100101101 |
3 | 1120111101210002202101111202 |
4 | 2232221322333212330231 |
5 | 3033121002220314411 |
6 | 41305422513055245 |
7 | 2346062520511253 |
oct | 256517277467455 |
9 | 46441702671452 |
10 | 12002202119981 |
11 | 3908118222177 |
12 | 141a135257525 |
13 | 690a589b4168 |
14 | 2d6ca424c5d3 |
15 | 15c31140a83b |
hex | aea7afe6f2d |
12002202119981 has 2 divisors, whose sum is σ = 12002202119982. Its totient is φ = 12002202119980.
The previous prime is 12002202119909. The next prime is 12002202120001. The reversal of 12002202119981 is 18991120220021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11170695223081 + 831506896900 = 3342259^2 + 911870^2 .
It is a cyclic number.
It is not a de Polignac number, because 12002202119981 - 214 = 12002202103597 is a prime.
It is a super-2 number, since 2×120022021199812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12002202119381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6001101059990 + 6001101059991.
It is an arithmetic number, because the mean of its divisors is an integer number (6001101059991).
Almost surely, 212002202119981 is an apocalyptic number.
It is an amenable number.
12002202119981 is a deficient number, since it is larger than the sum of its proper divisors (1).
12002202119981 is an equidigital number, since it uses as much as digits as its factorization.
12002202119981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 38.
The spelling of 12002202119981 in words is "twelve trillion, two billion, two hundred two million, one hundred nineteen thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •