Search a number
BaseRepresentation
bin10110111000110000001101…
…01010110100100000110001
320121012100202101121120201001
423130120012222310200301
523044040321344203321
6255012340025042001
713413055051113466
oct1334300652644061
9217170671546631
1050328538662961
1115044239016259
12578a011926301
132210c64c407b0
14c5dcb2a7766d
155c42629d8c91
hex2dc606ab4831

50328538662961 has 8 divisors (see below), whose sum is σ = 54223560725544. Its totient is φ = 46436887459200.

The previous prime is 50328538662959. The next prime is 50328538662973. The reversal of 50328538662961 is 16926683582305.

It can be written as a sum of positive squares in 4 ways, for example, as 3736392350625 + 46592146312336 = 1932975^2 + 6825844^2 .

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 50328538662961 - 21 = 50328538662959 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 50328538662893 and 50328538662902.

It is not an unprimeable number, because it can be changed into a prime (50328538762961) 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, 842683690 + ... + 842743411.

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

Almost surely, 250328538662961 is an apocalyptic number.

It is an amenable number.

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

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

50328538662961 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 1685429411.

The product of its (nonzero) digits is 111974400, while the sum is 64.

The spelling of 50328538662961 in words is "fifty trillion, three hundred twenty-eight billion, five hundred thirty-eight million, six hundred sixty-two thousand, nine hundred sixty-one".