Search a number
-
+
530505552751 = 19922511184299
BaseRepresentation
bin1111011100001001001…
…10000101001101101111
31212201022211210100121121
413232010212011031233
532142433410142001
61043413315041411
753220264540046
oct7560446051557
91781284710547
10530505552751
11194a93610819
12869952a0267
133b0461904c5
141b96886b55d
15dbedd206a1
hex7b8498536f

530505552751 has 8 divisors (see below), whose sum is σ = 533408720000. Its totient is φ = 527604759000.

The previous prime is 530505552727. The next prime is 530505552761. The reversal of 530505552751 is 157255505035.

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 530505552751 - 217 = 530505421679 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

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

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

Almost surely, 2530505552751 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1186749.

The product of its (nonzero) digits is 656250, while the sum is 43.

The spelling of 530505552751 in words is "five hundred thirty billion, five hundred five million, five hundred fifty-two thousand, seven hundred fifty-one".

Divisors: 1 199 2251 447949 1184299 235675501 2665857049 530505552751