Search a number
-
+
50325154041 = 389971194113
BaseRepresentation
bin101110110111100111…
…001110100011111001
311210220020122201010010
4232313213032203321
51311031214412131
635041414412133
73431050515501
oct566747164371
9153806581103
1050325154041
111a3852680a8
129905961049
134990236b76
1426159b0a01
1514981c1b46
hexbb79ce8f9

50325154041 has 16 divisors (see below), whose sum is σ = 67924370880. Its totient is φ = 33138800640.

The previous prime is 50325154039. The next prime is 50325154051. The reversal of 50325154041 is 14045152305.

It is not a de Polignac number, because 50325154041 - 21 = 50325154039 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (50325154051) 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 15 ways as a sum of consecutive naturals, for example, 162201 + ... + 356313.

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

Almost surely, 250325154041 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 195176.

The product of its (nonzero) digits is 12000, while the sum is 30.

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

Divisors: 1 3 89 267 971 2913 86419 194113 259257 582339 17276057 51828171 188483723 565451169 16775051347 50325154041