Search a number
-
+
50605050051 = 3310717516459
BaseRepresentation
bin101111001000010010…
…111100100011000011
311211121202022220021000
4233020102330203003
51312114343100201
635125253503043
73441016554033
oct571022744303
9154552286230
1050605050051
111a509260116
129983641a83
134a062160ca
142640c2d8c3
1514b2a5dd86
hexbc84bc8c3

50605050051 has 16 divisors (see below), whose sum is σ = 75671107200. Its totient is φ = 33421401864.

The previous prime is 50605050043. The next prime is 50605050061. The reversal of 50605050051 is 15005050605.

50605050051 is a `hidden beast` number, since 5 + 0 + 60 + 50 + 500 + 51 = 666.

It is not a de Polignac number, because 50605050051 - 23 = 50605050043 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (27).

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

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8755341 + ... + 8761118.

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

Almost surely, 250605050051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 17516575 (or 17516569 counting only the distinct ones).

The product of its (nonzero) digits is 3750, while the sum is 27.

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

Divisors: 1 3 9 27 107 321 963 2889 17516459 52549377 157648131 472944393 1874261113 5622783339 16868350017 50605050051