Search a number
-
+
500503213325 = 5223870440371
BaseRepresentation
bin1110100100010000101…
…00001111010100001101
31202211212221002121011002
413102020110033110031
531200012310311300
61021532240510045
751105636055523
oct7221024172415
91684787077132
10500503213325
1118329801a085
128100161b325
133827448963b
141a31ddb4313
15d044dd35d5
hex748850f50d

500503213325 has 12 divisors (see below), whose sum is σ = 647607636768. Its totient is φ = 382993762800.

The previous prime is 500503213307. The next prime is 500503213337. The reversal of 500503213325 is 523312305005.

It is not a de Polignac number, because 500503213325 - 26 = 500503213261 is a prime.

It is a super-3 number, since 3×5005032133253 (a number of 36 digits) contains 333 as substring.

It is a Duffinian number.

It is a congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 2500503213325 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 13500, while the sum is 29.

The spelling of 500503213325 in words is "five hundred billion, five hundred three million, two hundred thirteen thousand, three hundred twenty-five".

Divisors: 1 5 23 25 115 575 870440371 4352201855 20020128533 21761009275 100100642665 500503213325