Base | Representation |
---|---|
bin | 1010111010100111101011… |
… | …1000010111000101001101 |
3 | 1120111101202222011212012101 |
4 | 2232221322320113011031 |
5 | 3033121001224014411 |
6 | 41305422404235101 |
7 | 2346062465406016 |
oct | 256517270270515 |
9 | 46441688155171 |
10 | 12002200219981 |
11 | 3908117144724 |
12 | 141a13469ba91 |
13 | 690a5849a3ba |
14 | 2d6ca3cb600d |
15 | 15c3111828c1 |
hex | aea7ae1714d |
12002200219981 has 2 divisors, whose sum is σ = 12002200219982. Its totient is φ = 12002200219980.
The previous prime is 12002200219949. The next prime is 12002200220069. The reversal of 12002200219981 is 18991200220021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11806845059881 + 195355160100 = 3436109^2 + 441990^2 .
It is a cyclic number.
It is not a de Polignac number, because 12002200219981 - 25 = 12002200219949 is a prime.
It is a super-2 number, since 2×120022002199812 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12002200219981.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12002200219901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6001100109990 + 6001100109991.
It is an arithmetic number, because the mean of its divisors is an integer number (6001100109991).
Almost surely, 212002200219981 is an apocalyptic number.
It is an amenable number.
12002200219981 is a deficient number, since it is larger than the sum of its proper divisors (1).
12002200219981 is an equidigital number, since it uses as much as digits as its factorization.
12002200219981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10368, while the sum is 37.
The spelling of 12002200219981 in words is "twelve trillion, two billion, two hundred million, two hundred nineteen thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •