Search a number
-
+
1043334234233 is a prime number
BaseRepresentation
bin11110010111010111001…
…00010000000001111001
310200202000202102121111022
433023223210100001321
5114043222030443413
62115145013312225
7135243536444234
oct17135344200171
93622022377438
101043334234233
11372525a80515
1214a256635675
1377503058765
14386d778241b
151c215d14608
hexf2eb910079

1043334234233 has 2 divisors, whose sum is σ = 1043334234234. Its totient is φ = 1043334234232.

The previous prime is 1043334234227. The next prime is 1043334234287. The reversal of 1043334234233 is 3324324333401.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 881414912569 + 161919321664 = 938837^2 + 402392^2 .

It is a cyclic number.

It is not a de Polignac number, because 1043334234233 - 212 = 1043334230137 is a prime.

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

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

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

Almost surely, 21043334234233 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 1043334234233 its reverse (3324324333401), we get a palindrome (4367658567634).

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