Search a number
-
+
51050641411 = 711662995343
BaseRepresentation
bin101111100010110110…
…101111100000000011
311212202210210021200201
4233202312233200003
51314022431011121
635241412230031
73455040202150
oct574266574003
9155683707621
1051050641411
111a717835540
129a8890b317
134a7762b233
1426840a1227
1514dbc2ae91
hexbe2daf803

51050641411 has 8 divisors (see below), whose sum is σ = 63647553024. Its totient is φ = 39779720520.

The previous prime is 51050641409. The next prime is 51050641423. The reversal of 51050641411 is 11414605015.

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 51050641411 - 21 = 51050641409 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (51050641441) 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 7 ways as a sum of consecutive naturals, for example, 331497595 + ... + 331497748.

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

Almost surely, 251050641411 is an apocalyptic number.

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

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

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

The sum of its prime factors is 662995361.

The product of its (nonzero) digits is 2400, while the sum is 28.

The spelling of 51050641411 in words is "fifty-one billion, fifty million, six hundred forty-one thousand, four hundred eleven".

Divisors: 1 7 11 77 662995343 4640967401 7292948773 51050641411