Search a number
-
+
50050605555105 = 353336707037007
BaseRepresentation
bin10110110000101010100001…
…00100001001110110100001
320120012210100202102211012120
423120111100210021312201
523030012120010230410
6254240533014014453
713354015443510501
oct1330252044116641
9216183322384176
1050050605555105
1114a47385023701
125744186647429
1321c09a0a84c1c
14c50668529a01
155bbde776d570
hex2d8550909da1

50050605555105 has 8 divisors (see below), whose sum is σ = 80080968888192. Its totient is φ = 26693656296048.

The previous prime is 50050605554947. The next prime is 50050605555113. The reversal of 50050605555105 is 50155550605005.

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

It is not a de Polignac number, because 50050605555105 - 232 = 50046310587809 is a prime.

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

It is a Curzon number.

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

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

Almost surely, 250050605555105 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3336707037015.

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

The spelling of 50050605555105 in words is "fifty trillion, fifty billion, six hundred five million, five hundred fifty-five thousand, one hundred five".

Divisors: 1 3 5 15 3336707037007 10010121111021 16683535185035 50050605555105