Search a number
-
+
13910083249 is a prime number
BaseRepresentation
bin11001111010001101…
…10000011010110001
31022220102021102222111
430331012300122301
5211441440130444
610220141205321
71001463520366
oct147506603261
938812242874
1013910083249
115998974477
122842560841
131408ab8aba
1495d58c46d
155662c1234
hex33d1b06b1

13910083249 has 2 divisors, whose sum is σ = 13910083250. Its totient is φ = 13910083248.

The previous prime is 13910083193. The next prime is 13910083279. The reversal of 13910083249 is 94238001931.

13910083249 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., 13861530225 + 48553024 = 117735^2 + 6968^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 13910083249 - 211 = 13910081201 is a prime.

It is a super-2 number, since 2×139100832492 (a number of 21 digits) contains 22 as substring.

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

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

Almost surely, 213910083249 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 46656, while the sum is 40.

The spelling of 13910083249 in words is "thirteen billion, nine hundred ten million, eighty-three thousand, two hundred forty-nine".