Search a number
-
+
13860485647 is a prime number
BaseRepresentation
bin11001110100010011…
…00011101000001111
31022202221221121212021
430322021203220033
5211341241020042
610211210151011
71000322120101
oct147211435017
938687847767
1013860485647
115972979018
122829a22467
1313cb7418c8
14956b5b571
15561c75867
hex33a263a0f

13860485647 has 2 divisors, whose sum is σ = 13860485648. Its totient is φ = 13860485646.

The previous prime is 13860485633. The next prime is 13860485651. The reversal of 13860485647 is 74658406831.

13860485647 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 is a cyclic number.

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

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

It is a junction number, because it is equal to n+sod(n) for n = 13860485594 and 13860485603.

It is a congruent number.

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

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

Almost surely, 213860485647 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3870720, while the sum is 52.

The spelling of 13860485647 in words is "thirteen billion, eight hundred sixty million, four hundred eighty-five thousand, six hundred forty-seven".