Search a number
-
+
13893249639 = 34631083213
BaseRepresentation
bin11001111000001101…
…00010101001100111
31022212020121012121110
430330012202221213
5211423132442024
610214340320103
71001200446663
oct147406425147
938766535543
1013893249639
11598a4170a5
1228389a3033
131405473999
1495b2498a3
15564a98629
hex33c1a2a67

13893249639 has 4 divisors (see below), whose sum is σ = 18524332856. Its totient is φ = 9262166424.

The previous prime is 13893249637. The next prime is 13893249707. The reversal of 13893249639 is 93694239831.

It is a happy number.

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

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 93694239831 = 331231413277.

It is not a de Polignac number, because 13893249639 - 21 = 13893249637 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (13893249631) 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 in 3 ways as a sum of consecutive naturals, for example, 2315541604 + ... + 2315541609.

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

Almost surely, 213893249639 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4631083216.

The product of its digits is 7558272, while the sum is 57.

The spelling of 13893249639 in words is "thirteen billion, eight hundred ninety-three million, two hundred forty-nine thousand, six hundred thirty-nine".

Divisors: 1 3 4631083213 13893249639