Search a number
-
+
1056033703337 is a prime number
BaseRepresentation
bin11110101111000001000…
…00111000010110101001
310201221210210201111001212
433113200200320112221
5114300224112001322
62125045111122505
7136203333241424
oct17274040702651
93657723644055
101056033703337
11377952549628
121507bb673435
13787780a4b12
143918023a9bb
151c70aba00e2
hexf5e08385a9

1056033703337 has 2 divisors, whose sum is σ = 1056033703338. Its totient is φ = 1056033703336.

The previous prime is 1056033703321. The next prime is 1056033703367. The reversal of 1056033703337 is 7333073306501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 956364687721 + 99669015616 = 977939^2 + 315704^2 .

It is a cyclic number.

It is not a de Polignac number, because 1056033703337 - 24 = 1056033703321 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 1056033703294 and 1056033703303.

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

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

Almost surely, 21056033703337 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 357210, while the sum is 41.

The spelling of 1056033703337 in words is "one trillion, fifty-six billion, thirty-three million, seven hundred three thousand, three hundred thirty-seven".