Search a number
-
+
516350211641 = 11241104081881
BaseRepresentation
bin1111000001110001101…
…11101111011000111001
31211100210100000112002122
413200320313233120321
531424441123233031
61033112533011025
752206432245015
oct7407067573071
91740710015078
10516350211641
11189a8a262500
12840a4783a75
13398cb632614
141adc48b9545
15d67125547b
hex7838def639

516350211641 has 12 divisors (see below), whose sum is σ = 581401392852. Its totient is φ = 457960272000.

The previous prime is 516350211617. The next prime is 516350211649. The reversal of 516350211641 is 146112053615.

It can be written as a sum of positive squares in 2 ways, for example, as 188360340025 + 327989871616 = 434005^2 + 572704^2 .

It is a de Polignac number, because none of the positive numbers 2k-516350211641 is a prime.

It is a Duffinian number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 52035980 + ... + 52045901.

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

Almost surely, 2516350211641 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 104081944 (or 104081933 counting only the distinct ones).

The product of its (nonzero) digits is 21600, while the sum is 35.

The spelling of 516350211641 in words is "five hundred sixteen billion, three hundred fifty million, two hundred eleven thousand, six hundred forty-one".

Divisors: 1 11 41 121 451 4961 104081881 1144900691 4267357121 12593907601 46940928331 516350211641