Search a number
-
+
50145330433 = 1115583292541
BaseRepresentation
bin101110101100111001…
…010000010100000001
311210102201021201111111
4232230321100110001
51310144201033213
635011512243321
73423435163432
oct565471202401
9153381251444
1050145330433
111a2a2805a50
1298756a0541
134961bc5373
1425d9b61489
151487500a3d
hexbace50501

50145330433 has 8 divisors (see below), whose sum is σ = 54707694336. Its totient is φ = 45583582800.

The previous prime is 50145330419. The next prime is 50145330439. The reversal of 50145330433 is 33403354105.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-50145330433 is a prime.

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25143 + ... + 317683.

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

Almost surely, 250145330433 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 308135.

The product of its (nonzero) digits is 32400, while the sum is 31.

Adding to 50145330433 its reverse (33403354105), we get a palindrome (83548684538).

The spelling of 50145330433 in words is "fifty billion, one hundred forty-five million, three hundred thirty thousand, four hundred thirty-three".

Divisors: 1 11 15583 171413 292541 3217951 4558666403 50145330433