Search a number
-
+
10004021001397 is a prime number
BaseRepresentation
bin1001000110010011111000…
…0111100011110010110101
31022102101010102110021210001
42101210332013203302311
52302401213334021042
633135441145031301
72051523652320403
oct221447607436265
938371112407701
1010004021001397
113207755061975
121156a1a485531
135774b52210a7
142682a918c473
15125362e65bb7
hex9193e1e3cb5

10004021001397 has 2 divisors, whose sum is σ = 10004021001398. Its totient is φ = 10004021001396.

The previous prime is 10004021001329. The next prime is 10004021001439. The reversal of 10004021001397 is 79310012040001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7293407798161 + 2710613203236 = 2700631^2 + 1646394^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10004021001397 is a prime.

It is a congruent number.

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

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

Almost surely, 210004021001397 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1512, while the sum is 28.

Adding to 10004021001397 its reverse (79310012040001), we get a palindrome (89314033041398).

The spelling of 10004021001397 in words is "ten trillion, four billion, twenty-one million, one thousand, three hundred ninety-seven".