Search a number
-
+
530404010119 = 650971814789
BaseRepresentation
bin1111011011111101000…
…10101110100010000111
31212201001202201110022101
413231332202232202013
532142231411310434
61043355250412531
753214622461304
oct7557642564207
91781052643271
10530404010119
11194a41266295
1286967291147
133b02b1297c9
141b9591980ab
15dbe4e63b14
hex7b7e8ae887

530404010119 has 4 divisors (see below), whose sum is σ = 530405475880. Its totient is φ = 530402544360.

The previous prime is 530404010057. The next prime is 530404010131. The reversal of 530404010119 is 911010404035.

It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.

It is a cyclic number.

It is not a de Polignac number, because 530404010119 - 27 = 530404009991 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (530404010159) 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, 243577 + ... + 1058365.

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

Almost surely, 2530404010119 is an apocalyptic number.

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

530404010119 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 1465760.

The product of its (nonzero) digits is 2160, while the sum is 28.

The spelling of 530404010119 in words is "five hundred thirty billion, four hundred four million, ten thousand, one hundred nineteen".

Divisors: 1 650971 814789 530404010119