Search a number
-
+
10213000113257 is a prime number
BaseRepresentation
bin1001010010011110011000…
…1111100110110001101001
31100011100112112112010010222
42110213212033212301221
52314312211012111012
633415442032415425
72102602443420164
oct224474617466151
940140475463128
1010213000113257
113288344347777
12118b4210a7575
1359110a888ab6
142744519a8adb
1512a9e483c972
hex949e63e6c69

10213000113257 has 2 divisors, whose sum is σ = 10213000113258. Its totient is φ = 10213000113256.

The previous prime is 10213000113137. The next prime is 10213000113259. The reversal of 10213000113257 is 75231100031201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9149995810816 + 1063004302441 = 3024896^2 + 1031021^2 .

It is a cyclic number.

It is not a de Polignac number, because 10213000113257 - 218 = 10212999851113 is a prime.

Together with 10213000113259, it forms a pair of twin primes.

It is a Chen prime.

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

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

Almost surely, 210213000113257 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1260, while the sum is 26.

Adding to 10213000113257 its reverse (75231100031201), we get a palindrome (85444100144458).

The spelling of 10213000113257 in words is "ten trillion, two hundred thirteen billion, one hundred thirteen thousand, two hundred fifty-seven".