Search a number
-
+
1057219709213 is a prime number
BaseRepresentation
bin11110110001001110011…
…01001000100100011101
310202001212110101211021102
433120213031020210131
5114310141221143323
62125402515242445
7136244614153463
oct17304715104435
93661773354242
101057219709213
11378400a67378
12150a908a9425
1378906a09745
1439253966833
151c779d74328
hexf62734891d

1057219709213 has 2 divisors, whose sum is σ = 1057219709214. Its totient is φ = 1057219709212.

The previous prime is 1057219709171. The next prime is 1057219709333. The reversal of 1057219709213 is 3129079127501.

1057219709213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1041497809444 + 15721899769 = 1020538^2 + 125387^2 .

It is a cyclic number.

It is not a de Polignac number, because 1057219709213 - 212 = 1057219705117 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 21057219709213 is an apocalyptic number.

It is an amenable number.

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

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

1057219709213 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 238140, while the sum is 47.

The spelling of 1057219709213 in words is "one trillion, fifty-seven billion, two hundred nineteen million, seven hundred nine thousand, two hundred thirteen".