Search a number
-
+
1057219709333 is a prime number
BaseRepresentation
bin11110110001001110011…
…01001000100110010101
310202001212110101211102212
433120213031020212111
5114310141221144313
62125402515243205
7136244614154024
oct17304715104625
93661773354385
101057219709333
11378400a67477
12150a908a9505
1378906a09808
14392539668bb
151c779d743a8
hexf627348995

1057219709333 has 2 divisors, whose sum is σ = 1057219709334. Its totient is φ = 1057219709332.

The previous prime is 1057219709213. The next prime is 1057219709353. The reversal of 1057219709333 is 3339079127501.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 655722594289 + 401497115044 = 809767^2 + 633638^2 .

It is a cyclic number.

It is not a de Polignac number, because 1057219709333 - 228 = 1056951273877 is a prime.

It is a super-2 number, since 2×10572197093332 (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 (1057219709353) by changing a digit.

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

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

Almost surely, 21057219709333 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1071630, while the sum is 50.

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