Search a number
-
+
530303063048 = 23116026171171
BaseRepresentation
bin1111011011110001000…
…01101001010000001000
31212200210201202210221222
413231320201221100020
532142030041004143
61043341243021212
753212255443053
oct7557041512010
91780721683858
10530303063048
1119499a288260
128693950a808
133b013243c05
141b9499dba9a
15dbdb173768
hex7b78869408

530303063048 has 16 divisors (see below), whose sum is σ = 1084710810960. Its totient is φ = 241046846800.

The previous prime is 530303063027. The next prime is 530303063071. The reversal of 530303063048 is 840360303035.

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

It is an unprimeable number.

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

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

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

Almost surely, 2530303063048 is an apocalyptic number.

It is an amenable number.

530303063048 is an abundant number, since it is smaller than the sum of its proper divisors (554407747912).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 6026171188 (or 6026171184 counting only the distinct ones).

The product of its (nonzero) digits is 77760, while the sum is 35.

The spelling of 530303063048 in words is "five hundred thirty billion, three hundred three million, sixty-three thousand, forty-eight".

Divisors: 1 2 4 8 11 22 44 88 6026171171 12052342342 24104684684 48209369368 66287882881 132575765762 265151531524 530303063048