Search a number
-
+
1055922711433 is a prime number
BaseRepresentation
bin11110101110110011110…
…01011110101110001001
310201221112001212111210121
433113121321132232021
5114300012203231213
62125030104143241
7136200514646032
oct17273171365611
93657461774717
101055922711433
113778a592a787
1215078a467b21
137875b0b3135
143916d5c7a89
151c70107888d
hexf5d9e5eb89

1055922711433 has 2 divisors, whose sum is σ = 1055922711434. Its totient is φ = 1055922711432.

The previous prime is 1055922711379. The next prime is 1055922711463. The reversal of 1055922711433 is 3341172295501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 828458578809 + 227464132624 = 910197^2 + 476932^2 .

It is a cyclic number.

It is not a de Polignac number, because 1055922711433 - 229 = 1055385840521 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 1055922711433.

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

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

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

Almost surely, 21055922711433 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 226800, while the sum is 43.

The spelling of 1055922711433 in words is "one trillion, fifty-five billion, nine hundred twenty-two million, seven hundred eleven thousand, four hundred thirty-three".