Search a number
-
+
50052750276551 = 117615979303581
BaseRepresentation
bin10110110000101110100000…
…11001100111011111000111
320120012222220020002221221012
423120113100121213133013
523030031013032322201
6254241525510512435
713354122545365631
oct1330272031473707
9216188806087835
1050052750276551
1114a48285727670
12574468496571b
1321c0c53200679
14c507cd2d7a51
155bbec0bbb5bb
hex2d85d06677c7

50052750276551 has 8 divisors (see below), whose sum is σ = 54674751953808. Its totient is φ = 45442707208000.

The previous prime is 50052750276511. The next prime is 50052750276587. The reversal of 50052750276551 is 15567205725005.

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

It is a cyclic number.

It is not a de Polignac number, because 50052750276551 - 210 = 50052750275527 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 50052750276551.

It is a congruent number.

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

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

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

Almost surely, 250052750276551 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5979304353.

The product of its (nonzero) digits is 3675000, while the sum is 50.

The spelling of 50052750276551 in words is "fifty trillion, fifty-two billion, seven hundred fifty million, two hundred seventy-six thousand, five hundred fifty-one".

Divisors: 1 11 761 8371 5979303581 65772339391 4550250025141 50052750276551