Search a number
-
+
1212201001057 is a prime number
BaseRepresentation
bin10001101000111100110…
…011110110000001100001
311021212220101001011221111
4101220330303312001201
5124330041424013212
62324513310223321
7153402320333464
oct21507463660141
94255811034844
101212201001057
11428100954842
12176b237b4b41
138a405297367
1442956b092db
15217eae11ea7
hex11a3ccf6061

1212201001057 has 2 divisors, whose sum is σ = 1212201001058. Its totient is φ = 1212201001056.

The previous prime is 1212201001021. The next prime is 1212201001079. The reversal of 1212201001057 is 7501001022121.

It is an a-pointer prime, because the next prime (1212201001079) can be obtained adding 1212201001057 to its sum of digits (22).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 819923006016 + 392277995041 = 905496^2 + 626321^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1212201001057 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 21212201001057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 280, while the sum is 22.

Adding to 1212201001057 its reverse (7501001022121), we get a palindrome (8713202023178).

The spelling of 1212201001057 in words is "one trillion, two hundred twelve billion, two hundred one million, one thousand, fifty-seven".