Search a number
BaseRepresentation
bin101111000101010101…
…111011011011011011
311211111022002111201020
4233011111323123123
51312014202002001
635120323453523
73436545443004
oct570525733333
9154438074636
1050555500251
111a493297673
12996ab272a3
1349c8b878b9
1426384121ab
hexbc557b6db

50555500251 has 4 divisors (see below), whose sum is σ = 67407333672. Its totient is φ = 33703666832.

The previous prime is 50555500249. The next prime is 50555500271. The reversal of 50555500251 is 15200555505.

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 50555500251 - 21 = 50555500249 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (50555500211) 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 in 3 ways as a sum of consecutive naturals, for example, 8425916706 + ... + 8425916711.

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

Almost surely, 250555500251 is an apocalyptic number.

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

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

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

The sum of its prime factors is 16851833420.

The product of its (nonzero) digits is 31250, while the sum is 33.

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

Divisors: 1 3 16851833417 50555500251