Search a number
-
+
1000523050229 is a prime number
BaseRepresentation
bin11101000111100111101…
…00100010110011110101
310112122112011122010111202
432203303310202303311
5112343032400101404
62043344533142245
7132166615414553
oct16436364426365
93478464563452
101000523050229
113563571a630a
12141aa918a985
137346c761511
14365d5abcbd3
151b05c63421e
hexe8f3d22cf5

1000523050229 has 2 divisors, whose sum is σ = 1000523050230. Its totient is φ = 1000523050228.

The previous prime is 1000523050217. The next prime is 1000523050297. The reversal of 1000523050229 is 9220503250001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 850655736100 + 149867314129 = 922310^2 + 387127^2 .

It is an emirp because it is prime and its reverse (9220503250001) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1000523050229 - 28 = 1000523049973 is a prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 21000523050229 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5400, while the sum is 29.

The spelling of 1000523050229 in words is "one trillion, five hundred twenty-three million, fifty thousand, two hundred twenty-nine".