Search a number
-
+
530505013124110 = 25151351327823261
BaseRepresentation
bin111100010011111011101001…
…0110110111101110000001110
32120120100210011111120012121111
41320213313102312331300032
51024013243231324432420
65120142345532522234
7216512502526311613
oct17047672266756016
92516323144505544
10530505013124110
11144042a047426a2
124b5bb51362037a
1319a0253c72611b
14950081874650a
15414e9bd4a545a
hex1e27dd2dbdc0e

530505013124110 has 16 divisors (see below), whose sum is σ = 961232924444832. Its totient is φ = 210796693956000.

The previous prime is 530505013124071. The next prime is 530505013124111. The reversal of 530505013124110 is 11421310505035.

It is a congruent number.

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

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

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

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

Almost surely, 2530505013124110 is an apocalyptic number.

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

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

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

The sum of its prime factors is 351327823419.

The product of its (nonzero) digits is 9000, while the sum is 31.

Adding to 530505013124110 its reverse (11421310505035), we get a palindrome (541926323629145).

The spelling of 530505013124110 in words is "five hundred thirty trillion, five hundred five billion, thirteen million, one hundred twenty-four thousand, one hundred ten".

Divisors: 1 2 5 10 151 302 755 1510 351327823261 702655646522 1756639116305 3513278232610 53050501312411 106101002624822 265252506562055 530505013124110