Search a number
-
+
6650550504137 is a prime number
BaseRepresentation
bin110000011000111001110…
…1100110100101011001001
3212112210020022002021201102
41200301303230310223021
51332430311412113022
622051115402031145
71254325561363241
oct140616354645311
925483208067642
106650550504137
11213453441a9a1
128b4b07aa84b5
133931b4b15ac7
1418dc61944b21
15b7ee1b8ca92
hex60c73b34ac9

6650550504137 has 2 divisors, whose sum is σ = 6650550504138. Its totient is φ = 6650550504136.

The previous prime is 6650550504127. The next prime is 6650550504167. The reversal of 6650550504137 is 7314050550566.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 6646517111056 + 4033393081 = 2578084^2 + 63509^2 .

It is a cyclic number.

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

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

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

It is not a weakly prime, because it can be changed into another prime (6650550504127) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3325275252068 + 3325275252069.

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

Almost surely, 26650550504137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1890000, while the sum is 47.

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