Search a number
-
+
50095009545 = 3571759271231
BaseRepresentation
bin101110101001111001…
…010010111100001001
311210022012121011012220
4232221321102330021
51310043310301140
635002513524253
73422254361340
oct565171227411
9153265534186
1050095009545
111a277366139
129860873689
134954656ba9
1425d31c2b57
151482db0bd0
hexba9e52f09

50095009545 has 32 divisors (see below), whose sum is σ = 91654717440. Its totient is φ = 22887472320.

The previous prime is 50095009529. The next prime is 50095009571. The reversal of 50095009545 is 54590059005.

It is not a de Polignac number, because 50095009545 - 24 = 50095009529 is a prime.

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

It is a Curzon number.

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

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 31 ways as a sum of consecutive naturals, for example, 49080 + ... + 320310.

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

Almost surely, 250095009545 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 273005.

The product of its (nonzero) digits is 202500, while the sum is 42.

The spelling of 50095009545 in words is "fifty billion, ninety-five million, nine thousand, five hundred forty-five".

Divisors: 1 3 5 7 15 21 35 105 1759 5277 8795 12313 26385 36939 61565 184695 271231 813693 1356155 1898617 4068465 5695851 9493085 28479255 477095329 1431285987 2385476645 3339667303 7156429935 10019001909 16698336515 50095009545