Search a number
-
+
1043100221 is a prime number
BaseRepresentation
bin111110001011000…
…111001000111101
32200200202222111112
4332023013020331
54114013201341
6251301131405
734564130342
oct7613071075
92620688445
101043100221
114958916a9
122513b9b65
1313814ab87
149c76a7c9
1561896aeb
hex3e2c723d

1043100221 has 2 divisors, whose sum is σ = 1043100222. Its totient is φ = 1043100220.

The previous prime is 1043100211. The next prime is 1043100239. The reversal of 1043100221 is 1220013401.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 899340121 + 143760100 = 29989^2 + 11990^2 .

It is a cyclic number.

It is not a de Polignac number, because 1043100221 - 218 = 1042838077 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

Almost surely, 21043100221 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 48, while the sum is 14.

The square root of 1043100221 is about 32297.0621109723. The cubic root of 1043100221 is about 1014.1651416769.

Adding to 1043100221 its reverse (1220013401), we get a palindrome (2263113622).

The spelling of 1043100221 in words is "one billion, forty-three million, one hundred thousand, two hundred twenty-one".