Search a number
-
+
50611111001 = 11232575471423
BaseRepresentation
bin101111001000101010…
…000100010001011001
311211122011201211022122
4233020222010101121
51312122421023001
635130031431025
73441122226323
oct571052042131
9154564654278
1050611111001
111a51171a870
129985685475
134a07558a79
14264196a613
1514b3359b1b
hexbc8a84459

50611111001 has 32 divisors (see below), whose sum is σ = 57983275008. Its totient is φ = 43727523840.

The previous prime is 50611110997. The next prime is 50611111013. The reversal of 50611111001 is 10011111605.

It is not a de Polignac number, because 50611111001 - 22 = 50611110997 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (50611111081) by changing a digit.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 35565776 + ... + 35567198.

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

Almost surely, 250611111001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2261.

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

Adding to 50611111001 its reverse (10011111605), we get a palindrome (60622222606).

The spelling of 50611111001 in words is "fifty billion, six hundred eleven million, one hundred eleven thousand, one".

Divisors: 1 11 23 253 257 547 1423 2827 5911 6017 12581 15653 32729 65021 138391 140579 360019 365711 778381 1546369 3233317 4022821 8411353 8562191 17902763 35566487 92524883 196930393 200043917 2200483087 4601010091 50611111001