Search a number
-
+
1056033703369 is a prime number
BaseRepresentation
bin11110101111000001000…
…00111000010111001001
310201221210210201111010001
433113200200320113021
5114300224112001434
62125045111123001
7136203333241501
oct17274040702711
93657723644101
101056033703369
11377952549657
121507bb673461
13787780a4b38
143918023aa01
151c70aba0114
hexf5e08385c9

1056033703369 has 2 divisors, whose sum is σ = 1056033703370. Its totient is φ = 1056033703368.

The previous prime is 1056033703367. The next prime is 1056033703393. The reversal of 1056033703369 is 9633073306501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 681475015225 + 374558688144 = 825515^2 + 612012^2 .

It is a cyclic number.

It is not a de Polignac number, because 1056033703369 - 21 = 1056033703367 is a prime.

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

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

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, 528016851684 + 528016851685.

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

Almost surely, 21056033703369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 918540, while the sum is 46.

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