Search a number
-
+
1056050033 is a prime number
BaseRepresentation
bin111110111100100…
…000101101110001
32201121010220022012
4332330200231301
54130322100113
6252442452305
735112164033
oct7674405561
92647126265
101056050033
114a2127025
12255804095
1313aa3329c
14a037bc53
1562aa3aa8
hex3ef20b71

1056050033 has 2 divisors, whose sum is σ = 1056050034. Its totient is φ = 1056050032.

The previous prime is 1056050011. The next prime is 1056050053. The reversal of 1056050033 is 3300506501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 802985569 + 253064464 = 28337^2 + 15908^2 .

It is a cyclic number.

It is not a de Polignac number, because 1056050033 - 28 = 1056049777 is a prime.

It is a super-2 number, since 2×10560500332 = 2230483344398602178, which contains 22 as substring.

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

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 21056050033 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1350, while the sum is 23.

The square root of 1056050033 is about 32496.9234389965. The cubic root of 1056050033 is about 1018.3447563921.

Adding to 1056050033 its reverse (3300506501), we get a palindrome (4356556534).

The spelling of 1056050033 in words is "one billion, fifty-six million, fifty thousand, thirty-three".