Search a number
-
+
5600650165051 = 43130247678257
BaseRepresentation
bin101000110000000000011…
…0000110111101100111011
3201211102020221100222200111
41101200000300313230323
51213230112420240201
615524523030045151
71115430221632114
oct121400060675473
921742227328614
105600650165051
11186a24a011747
1276553a4a97b7
133181a6632906
1415510411120b
159aa446bab51
hex51800c37b3b

5600650165051 has 4 divisors (see below), whose sum is σ = 5730897843352. Its totient is φ = 5470402486752.

The previous prime is 5600650165039. The next prime is 5600650165111. The reversal of 5600650165051 is 1505610560065.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 5600650165051 - 233 = 5592060230459 is a prime.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (5600650165031) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 65123839086 + ... + 65123839171.

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

Almost surely, 25600650165051 is an apocalyptic number.

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

5600650165051 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 130247678300.

The product of its (nonzero) digits is 135000, while the sum is 40.

The spelling of 5600650165051 in words is "five trillion, six hundred billion, six hundred fifty million, one hundred sixty-five thousand, fifty-one".

Divisors: 1 43 130247678257 5600650165051