Search a number
-
+
1035243403433 is a prime number
BaseRepresentation
bin11110001000010010101…
…00001011100010101001
310122222010220002211011022
433010021110023202221
5113430134302402213
62111330110542225
7134536203511241
oct17041124134251
93588126084138
101035243403433
1136a053a04598
12148778b07975
1376813a62505
143816add2b21
151bde0876308
hexf10950b8a9

1035243403433 has 2 divisors, whose sum is σ = 1035243403434. Its totient is φ = 1035243403432.

The previous prime is 1035243403399. The next prime is 1035243403477. The reversal of 1035243403433 is 3343043425301.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 949305308329 + 85938095104 = 974323^2 + 293152^2 .

It is a cyclic number.

It is not a de Polignac number, because 1035243403433 - 28 = 1035243403177 is a prime.

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

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

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

Almost surely, 21035243403433 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 155520, while the sum is 35.

Adding to 1035243403433 its reverse (3343043425301), we get a palindrome (4378286828734).

The spelling of 1035243403433 in words is "one trillion, thirty-five billion, two hundred forty-three million, four hundred three thousand, four hundred thirty-three".