Search a number
-
+
50926229609 = 421112093619
BaseRepresentation
bin101111011011011100…
…001001100001101001
311212110010200111210012
4233123130021201221
51313244103321414
635221205501305
73451666544423
oct573334114151
9155403614705
1050926229609
111a663590072
129a53111835
134a5791b198
142671757813
1514d0d5333e
hexbdb709869

50926229609 has 4 divisors (see below), whose sum is σ = 50938327440. Its totient is φ = 50914131780.

The previous prime is 50926229581. The next prime is 50926229611. The reversal of 50926229609 is 90692262905.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 50926229609 - 212 = 50926225513 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (50926229699) 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, 6042599 + ... + 6051020.

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

Almost surely, 250926229609 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 12097830.

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

The spelling of 50926229609 in words is "fifty billion, nine hundred twenty-six million, two hundred twenty-nine thousand, six hundred nine".

Divisors: 1 4211 12093619 50926229609