Search a number
-
+
503052673213 = 1409357028157
BaseRepresentation
bin1110101001000000100…
…01101010000010111101
31210002110121100120122101
413110200101222002331
531220222441020323
61023033232345101
751226054112266
oct7244021520275
91702417316571
10503052673213
11184386135022
12815b33a5191
133858c71539c
141a4c281b96d
15d143b2ddad
hex752046a0bd

503052673213 has 4 divisors (see below), whose sum is σ = 503409702780. Its totient is φ = 502695643648.

The previous prime is 503052673199. The next prime is 503052673229. The reversal of 503052673213 is 312376250305.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 73396020889 + 429656652324 = 270917^2 + 655482^2 .

It is a cyclic number.

It is not a de Polignac number, because 503052673213 - 225 = 503019118781 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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 3 ways as a sum of consecutive naturals, for example, 178512670 + ... + 178515487.

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

Almost surely, 2503052673213 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 357029566.

The product of its (nonzero) digits is 113400, while the sum is 37.

The spelling of 503052673213 in words is "five hundred three billion, fifty-two million, six hundred seventy-three thousand, two hundred thirteen".

Divisors: 1 1409 357028157 503052673213