Search a number
-
+
49510006050 = 2352330066707
BaseRepresentation
bin101110000111000001…
…101011110100100010
311201210102210220021210
4232013001223310202
51302344030143200
634424455130550
73401622051651
oct560701536442
9151712726253
1049510006050
1119aa712037a
129718973a56
1348903ac18b
142579621198
15144b856650
hexb8706bd22

49510006050 has 24 divisors (see below), whose sum is σ = 122784815376. Its totient is φ = 13202668240.

The previous prime is 49510006037. The next prime is 49510006069. The reversal of 49510006050 is 5060001594.

It is a Harshad number since it is a multiple of its sum of digits (30).

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

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 165033204 + ... + 165033503.

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

Almost surely, 249510006050 is an apocalyptic number.

49510006050 is an abundant number, since it is smaller than the sum of its proper divisors (73274809326).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 330066722 (or 330066717 counting only the distinct ones).

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

The spelling of 49510006050 in words is "forty-nine billion, five hundred ten million, six thousand, fifty".

Divisors: 1 2 3 5 6 10 15 25 30 50 75 150 330066707 660133414 990200121 1650333535 1980400242 3300667070 4951000605 8251667675 9902001210 16503335350 24755003025 49510006050