Search a number
-
+
530502749999 = 1129946951301
BaseRepresentation
bin1111011100001000110…
…11011000111100101111
31212201022122111221221222
413232010123120330233
532142432200444444
61043413135013555
753220231654545
oct7560433307457
91781278457858
10530502749999
11194a91a76aa2
128699436a2bb
133b04571b881
141b96833bd95
15dbed969eee
hex7b846d8f2f

530502749999 has 4 divisors (see below), whose sum is σ = 530549712600. Its totient is φ = 530455787400.

The previous prime is 530502749971. The next prime is 530502750013. The reversal of 530502749999 is 999947205035.

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

It is a cyclic number.

It is not a de Polignac number, because 530502749999 - 228 = 530234314543 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 (530502749929) by changing a digit.

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

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

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

Almost surely, 2530502749999 is an apocalyptic number.

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

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

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

The sum of its prime factors is 46962600.

The product of its (nonzero) digits is 27556200, while the sum is 62.

The spelling of 530502749999 in words is "five hundred thirty billion, five hundred two million, seven hundred forty-nine thousand, nine hundred ninety-nine".

Divisors: 1 11299 46951301 530502749999