Search a number
-
+
1441302213101 is a prime number
BaseRepresentation
bin10100111110010100010…
…011100111000111101101
312002210020211101121112012
4110332110103213013231
5142103241331304401
63022043004251005
7206062545446342
oct24762423470755
95083224347465
101441302213101
11506286585303
121b3401240a65
13a5bb66ba81a
144da8bb127c9
15277591228bb
hex14f944e71ed

1441302213101 has 2 divisors, whose sum is σ = 1441302213102. Its totient is φ = 1441302213100.

The previous prime is 1441302213097. The next prime is 1441302213103. The reversal of 1441302213101 is 1013122031441.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 782649855625 + 658652357476 = 884675^2 + 811574^2 .

It is a cyclic number.

It is not a de Polignac number, because 1441302213101 - 22 = 1441302213097 is a prime.

Together with 1441302213103, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

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

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

Almost surely, 21441302213101 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 576, while the sum is 23.

Adding to 1441302213101 its reverse (1013122031441), we get a palindrome (2454424244542).

The spelling of 1441302213101 in words is "one trillion, four hundred forty-one billion, three hundred two million, two hundred thirteen thousand, one hundred one".