Search a number
-
+
530315151325115 = 51321413810693431
BaseRepresentation
bin111100010010100011001111…
…0001101101011011110111011
32120112200122002201002111101012
41320211012132031223132323
51024002140412214400430
65115515230043344135
7216463001551535132
oct17045063615533673
92515618081074335
10530315151325115
11143a7a4356a9a12
124b58a76722204b
13199ba672921970
1494d5566cc0919
154149aaa0dc695
hex1e2519e36b7bb

530315151325115 has 16 divisors (see below), whose sum is σ = 685650447832896. Its totient is φ = 391434429129600.

The previous prime is 530315151325103. The next prime is 530315151325121. The reversal of 530315151325115 is 511523151513035.

It is not a de Polignac number, because 530315151325115 - 220 = 530315150276539 is a prime.

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1905207551 + ... + 1905485880.

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

Almost surely, 2530315151325115 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3810695590.

The product of its (nonzero) digits is 168750, while the sum is 41.

The spelling of 530315151325115 in words is "five hundred thirty trillion, three hundred fifteen billion, one hundred fifty-one million, three hundred twenty-five thousand, one hundred fifteen".

Divisors: 1 5 13 65 2141 10705 27833 139165 3810693431 19053467155 49539014603 247695073015 8158694635771 40793473178855 106063030265023 530315151325115