Search a number
-
+
13893725921 is a prime number
BaseRepresentation
bin11001111000010000…
…10110111011100001
31022212021111101221112
430330020112323201
5211423243212141
610214354433105
71001204502365
oct147410267341
938767441845
1013893725921
11598a711a19
122838b92795
1314055ac6ca
1495b3312a5
15564b3e7eb
hex33c216ee1

13893725921 has 2 divisors, whose sum is σ = 13893725922. Its totient is φ = 13893725920.

The previous prime is 13893725903. The next prime is 13893725933. The reversal of 13893725921 is 12952739831.

13893725921 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 13773604321 + 120121600 = 117361^2 + 10960^2 .

It is a cyclic number.

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

It is a self number, because there is not a number n which added to its sum of digits gives 13893725921.

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

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

Almost surely, 213893725921 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 816480, while the sum is 50.

The spelling of 13893725921 in words is "thirteen billion, eight hundred ninety-three million, seven hundred twenty-five thousand, nine hundred twenty-one".