Search a number
-
+
1210432332313 is a prime number
BaseRepresentation
bin10001100111010011011…
…000111010001000011001
311021201100002222111112201
4101213103120322020121
5124312431134113223
62324022005410201
7153310433031031
oct21472330721031
94251302874481
101210432332313
1142738354a836
1217670b409961
138a1b2a271c9
1442829c6a8c1
15217459e6ead
hex119d363a219

1210432332313 has 2 divisors, whose sum is σ = 1210432332314. Its totient is φ = 1210432332312.

The previous prime is 1210432332301. The next prime is 1210432332409. The reversal of 1210432332313 is 3132332340121.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1085320153369 + 125112178944 = 1041787^2 + 353712^2 .

It is a cyclic number.

It is not a de Polignac number, because 1210432332313 - 213 = 1210432324121 is a prime.

It is a super-2 number, since 2×12104323323132 (a number of 25 digits) contains 22 as substring.

It is not a weakly prime, because it can be changed into another prime (1210432332013) 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, 605216166156 + 605216166157.

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

Almost surely, 21210432332313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7776, while the sum is 28.

Adding to 1210432332313 its reverse (3132332340121), we get a palindrome (4342764672434).

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