Search a number
-
+
50050611050495 = 511910011110009
BaseRepresentation
bin10110110000101010100001…
…11001000111011111111111
320120012210101010210000110112
423120111100321013133333
523030012122412103440
6254240533331500235
713354015541306156
oct1330252071073777
9216183333700415
1050050611050495
1114a47388137450
12574418845767b
1321c09a1c5a333
14c5066915a59d
155bbde7ea6965
hex2d8550e477ff

50050611050495 has 8 divisors (see below), whose sum is σ = 65520799920720. Its totient is φ = 36400444400320.

The previous prime is 50050611050483. The next prime is 50050611050537. The reversal of 50050611050495 is 59405011605005.

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

It is not a de Polignac number, because 50050611050495 - 210 = 50050611049471 is a prime.

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 250050611050495 is an apocalyptic number.

50050611050495 is a gapful number since it is divisible by the number (55) formed by its first and last digit.

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

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

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

The sum of its prime factors is 910011110025.

The product of its (nonzero) digits is 135000, while the sum is 41.

The spelling of 50050611050495 in words is "fifty trillion, fifty billion, six hundred eleven million, fifty thousand, four hundred ninety-five".

Divisors: 1 5 11 55 910011110009 4550055550045 10010122210099 50050611050495