Search a number
-
+
50555555555 = 5101421237791
BaseRepresentation
bin101111000101010110…
…001000111011100011
311211111022012022120112
4233011112020323203
51312014210234210
635120325001535
73436546063151
oct570526107343
9154438168515
1050555555555
111a49332517a
12996ab532ab
1349c8ba6b1b
1426384283d1
1514ad533d05
hexbc5588ee3

50555555555 has 16 divisors (see below), whose sum is σ = 61413113088. Its totient is φ = 39948720000.

The previous prime is 50555555549. The next prime is 50555555569. The reversal of 50555555555 is 55555555505.

It is not a de Polignac number, because 50555555555 - 216 = 50555490019 is a prime.

It is a super-3 number, since 3×505555555553 (a number of 33 digits) contains 333 as substring.

It is a Duffinian number.

50555555555 is a modest number, since divided by 555555 gives 50555 as remainder.

It is an unprimeable number.

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 15 ways as a sum of consecutive naturals, for example, 93710 + ... + 331500.

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

Almost surely, 250555555555 is an apocalyptic number.

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

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

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

The sum of its prime factors is 238318.

The product of its (nonzero) digits is 9765625, while the sum is 50.

Subtracting from 50555555555 its sum of digits (50), we obtain a palindrome (50555555505).

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

Divisors: 1 5 101 421 505 2105 42521 212605 237791 1188955 24016891 100110011 120084455 500550055 10111111111 50555555555