Search a number
-
+
6550016070137 is a prime number
BaseRepresentation
bin101111101010000101101…
…1000011001000111111001
3212012011201212210212211212
41133110023120121013321
51324303413103221022
621533011424132505
71244136334654151
oct137241330310771
925164655725755
106550016070137
1120a5934349701
1289952b167135
13386882686037
14189045927761
15b55aaa873e2
hex5f50b6191f9

6550016070137 has 2 divisors, whose sum is σ = 6550016070138. Its totient is φ = 6550016070136.

The previous prime is 6550016070097. The next prime is 6550016070149. The reversal of 6550016070137 is 7310706100556.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4879552878841 + 1670463191296 = 2208971^2 + 1292464^2 .

It is a cyclic number.

It is not a de Polignac number, because 6550016070137 - 228 = 6549747634681 is a prime.

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

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

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

Almost surely, 26550016070137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 132300, while the sum is 41.

The spelling of 6550016070137 in words is "six trillion, five hundred fifty billion, sixteen million, seventy thousand, one hundred thirty-seven".