Search a number
-
+
503125860161 = 1797433037631
BaseRepresentation
bin1110101001001001010…
…00110101111101000001
31210002122201001212021002
413110210220311331001
531220400210011121
61023044405141345
751230633151311
oct7244450657501
91702581055232
10503125860161
11184413482501
12816139ba855
13385a192b682
141a4cc42d441
15d14a288e0b
hex7524a35f41

503125860161 has 8 divisors (see below), whose sum is σ = 532776351744. Its totient is φ = 473481463360.

The previous prime is 503125860143. The next prime is 503125860169. The reversal of 503125860161 is 161068521305.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 503125860161 - 234 = 485945990977 is a prime.

It is a super-2 number, since 2×5031258601612 (a number of 24 digits) contains 22 as substring.

It is a Duffinian number.

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

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

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

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

Almost surely, 2503125860161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3047391.

The product of its (nonzero) digits is 43200, while the sum is 38.

The spelling of 503125860161 in words is "five hundred three billion, one hundred twenty-five million, eight hundred sixty thousand, one hundred sixty-one".

Divisors: 1 17 9743 165631 3037631 51639727 29595638833 503125860161