Search a number
-
+
1221010212017 is a prime number
BaseRepresentation
bin10001110001001001111…
…000010100010010110001
311022201122022010110121002
4101301021320110102301
5130001112103241032
62332531354211345
7154133525362331
oct21611170242261
94281568113532
101221010212017
11430911484382
12178781a23b55
138b1aa366a1b
1443150a590c1
1521b644a3862
hex11c49e144b1

1221010212017 has 2 divisors, whose sum is σ = 1221010212018. Its totient is φ = 1221010212016.

The previous prime is 1221010211987. The next prime is 1221010212031. The reversal of 1221010212017 is 7102120101221.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1190507938816 + 30502273201 = 1091104^2 + 174649^2 .

It is a cyclic number.

It is not a de Polignac number, because 1221010212017 - 28 = 1221010211761 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1221010212017.

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

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

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

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

Almost surely, 21221010212017 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 112, while the sum is 20.

Adding to 1221010212017 its reverse (7102120101221), we get a palindrome (8323130313238).

The spelling of 1221010212017 in words is "one trillion, two hundred twenty-one billion, ten million, two hundred twelve thousand, seventeen".