Search a number
-
+
530505100514 = 2265252550257
BaseRepresentation
bin1111011100001001001…
…00010110110011100010
31212201022210221101021002
413232010210112303202
532142433301204024
61043413301232002
753220260644424
oct7560444266342
91781283841232
10530505100514
11194a93331a74
1286995102602
133b0460626cc
141b968790814
15dbedc816ae
hex7b84916ce2

530505100514 has 4 divisors (see below), whose sum is σ = 795757650774. Its totient is φ = 265252550256.

The previous prime is 530505100487. The next prime is 530505100537. The reversal of 530505100514 is 415001505035.

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

It can be written as a sum of positive squares in only one way, i.e., 510345928225 + 20159172289 = 714385^2 + 141983^2 .

It is a super-3 number, since 3×5305051005143 (a number of 36 digits) contains 333 as substring.

It is a Curzon number.

It is an unprimeable number.

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 as a sum of consecutive naturals, namely, 132626275127 + ... + 132626275130.

Almost surely, 2530505100514 is an apocalyptic number.

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

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

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

The sum of its prime factors is 265252550259.

The product of its (nonzero) digits is 7500, while the sum is 29.

Adding to 530505100514 its reverse (415001505035), we get a palindrome (945506605549).

The spelling of 530505100514 in words is "five hundred thirty billion, five hundred five million, one hundred thousand, five hundred fourteen".

Divisors: 1 2 265252550257 530505100514