Search a number
-
+
51050160651 = 377433271817
BaseRepresentation
bin101111100010110100…
…111010001000001011
311212202202212212012210
4233202310322020023
51314022320120101
635241354040203
73455033130420
oct574264721013
9155682785183
1051050160651
111a717537316
129a88719063
134a774c0469
142683db7d47
1514dbb837d6
hexbe2d3a20b

51050160651 has 16 divisors (see below), whose sum is σ = 77895442944. Its totient is φ = 29132249664.

The previous prime is 51050160647. The next prime is 51050160653. The reversal of 51050160651 is 15606105015.

51050160651 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 51050160651 - 22 = 51050160647 is a prime.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1620306 + ... + 1651511.

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

Almost surely, 251050160651 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3272570.

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

Adding to 51050160651 its reverse (15606105015), we get a palindrome (66656265666).

The spelling of 51050160651 in words is "fifty-one billion, fifty million, one hundred sixty thousand, six hundred fifty-one".

Divisors: 1 3 7 21 743 2229 5201 15603 3271817 9815451 22902719 68708157 2430960031 7292880093 17016720217 51050160651