Search a number
-
+
60731639463967 is a prime number
BaseRepresentation
bin11011100111100001011111…
…10011000000000000011111
321222000212222101010012211221
431303300233303000000133
530430011344200321332
6333055421403154211
715535500432654223
oct1563605763000037
9258025871105757
1060731639463967
111839516423032a
12698a247215967
1327b6c79c52b34
1410dd5d9ad0783
15704b8167b297
hex373c2fcc001f

60731639463967 has 2 divisors, whose sum is σ = 60731639463968. Its totient is φ = 60731639463966.

The previous prime is 60731639463863. The next prime is 60731639464003. The reversal of 60731639463967 is 76936493613706.

60731639463967 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-60731639463967 is a prime.

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

It is a congruent number.

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

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

Almost surely, 260731639463967 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 555532992, while the sum is 70.

The spelling of 60731639463967 in words is "sixty trillion, seven hundred thirty-one billion, six hundred thirty-nine million, four hundred sixty-three thousand, nine hundred sixty-seven".