Search a number
-
+
503260315132 = 22532373869411
BaseRepresentation
bin1110101001011001010…
…01101111110111111100
31210010000002001212210211
413110230221233313330
531221134120041012
61023110011042204
751234155045311
oct7245451576774
91703002055724
10503260315132
11184482367513
1281650a40364
13385c3746b23
141a50222cd08
15d156e976a7
hex752ca6fdfc

503260315132 has 12 divisors (see below), whose sum is σ = 897322637736. Its totient is φ = 246882418640.

The previous prime is 503260315081. The next prime is 503260315189. The reversal of 503260315132 is 231513062305.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1186934494 + ... + 1186934917.

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

Almost surely, 2503260315132 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 503260315132 its reverse (231513062305), we get a palindrome (734773377437).

The spelling of 503260315132 in words is "five hundred three billion, two hundred sixty million, three hundred fifteen thousand, one hundred thirty-two".

Divisors: 1 2 4 53 106 212 2373869411 4747738822 9495477644 125815078783 251630157566 503260315132