Search a number
-
+
1123069433 is a prime number
BaseRepresentation
bin100001011110000…
…1010110111111001
32220021020211122012
41002330022313321
54300001210213
6303235135305
736554634623
oct10274126771
92807224565
101123069433
11526a41762
12274144535
1314b89a235
14a9225c13
15688e14a8
hex42f0adf9

1123069433 has 2 divisors, whose sum is σ = 1123069434. Its totient is φ = 1123069432.

The previous prime is 1123069421. The next prime is 1123069439. The reversal of 1123069433 is 3349603211.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1091113024 + 31956409 = 33032^2 + 5653^2 .

It is a cyclic number.

It is not a de Polignac number, because 1123069433 - 214 = 1123053049 is a prime.

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

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

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

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

Almost surely, 21123069433 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11664, while the sum is 32.

The square root of 1123069433 is about 33512.2281115416. The cubic root of 1123069433 is about 1039.4466462723.

The spelling of 1123069433 in words is "one billion, one hundred twenty-three million, sixty-nine thousand, four hundred thirty-three".