Search a number
-
+
12002199748057 is a prime number
BaseRepresentation
bin1010111010100111101011…
…0110100011110111011001
31120111101202221021212211201
42232221322312203313121
53033121001113414212
641305422350154201
72346062461402111
oct256517266436731
946441687255751
1012002199748057
113908116952102
12141a1344b2961
13690a5836365c
142d6ca3bd2041
1515c3110dcb57
hexaea7ada3dd9

12002199748057 has 2 divisors, whose sum is σ = 12002199748058. Its totient is φ = 12002199748056.

The previous prime is 12002199747929. The next prime is 12002199748087. The reversal of 12002199748057 is 75084799120021.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9057306935296 + 2944892812761 = 3009536^2 + 1716069^2 .

It is a cyclic number.

It is not a de Polignac number, because 12002199748057 - 27 = 12002199747929 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 12002199747989 and 12002199748007.

It is not a weakly prime, because it can be changed into another prime (12002199748087) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6001099874028 + 6001099874029.

It is an arithmetic number, because the mean of its divisors is an integer number (6001099874029).

Almost surely, 212002199748057 is an apocalyptic number.

It is an amenable number.

12002199748057 is a deficient number, since it is larger than the sum of its proper divisors (1).

12002199748057 is an equidigital number, since it uses as much as digits as its factorization.

12002199748057 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 2540160, while the sum is 55.

The spelling of 12002199748057 in words is "twelve trillion, two billion, one hundred ninety-nine million, seven hundred forty-eight thousand, fifty-seven".