Search a number
-
+
10601414503639 is a prime number
BaseRepresentation
bin1001101001000101010110…
…0010111010110011010111
31101112111002210201112112021
42122101111202322303113
52342143144103104024
634314120025034011
72142632635312531
oct232212542726327
941474083645467
1010601414503639
113418042122093
121232760325907
135bb92ab71c1b
1428917b1bc851
15135b7906cde4
hex9a4558bacd7

10601414503639 has 2 divisors, whose sum is σ = 10601414503640. Its totient is φ = 10601414503638.

The previous prime is 10601414503613. The next prime is 10601414503661. The reversal of 10601414503639 is 93630541410601.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10601414503639 - 211 = 10601414501591 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 210601414503639 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 233280, while the sum is 43.

The spelling of 10601414503639 in words is "ten trillion, six hundred one billion, four hundred fourteen million, five hundred three thousand, six hundred thirty-nine".