Search a number
-
+
50511451151 = 719736917529
BaseRepresentation
bin101111000010101101…
…111001010000001111
311211101020012120201002
4233002231321100033
51311421412414101
635112111410515
73435502151660
oct570255712017
9154336176632
1050511451151
111a470440957
129958223a3b
1349bca04045
142632627367
1514a9720d6b
hexbc2b7940f

50511451151 has 32 divisors (see below), whose sum is σ = 61695398400. Its totient is φ = 40391032320.

The previous prime is 50511451117. The next prime is 50511451153. The reversal of 50511451151 is 15115411505.

It is a cyclic number.

It is not a de Polignac number, because 50511451151 - 226 = 50444342287 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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, 6705155 + ... + 6712683.

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

Almost surely, 250511451151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 8319.

The product of its (nonzero) digits is 2500, while the sum is 29.

Adding to 50511451151 its reverse (15115411505), we get a palindrome (65626862656).

The spelling of 50511451151 in words is "fifty billion, five hundred eleven million, four hundred fifty-one thousand, one hundred fifty-one".

Divisors: 1 7 19 73 133 511 691 1387 4837 7529 9709 13129 50443 52703 91903 143051 353101 549617 958417 1001357 3847319 5202539 6708919 10442723 36417773 73099061 98848241 379785347 691937687 2658497429 7215921593 50511451151