Search a number
-
+
530656019712 = 28337213273127
BaseRepresentation
bin1111011100011011001…
…00000100010100000000
31212201201022220212111000
413232031210010110000
532143240420112322
61043440252052000
753224102513200
oct7561544042400
91781638825430
10530656019712
11195060541885
1286a17764000
133b06b3c3b00
141b980838400
15dc0c1433ac
hex7b8d904500

530656019712 has 1296 divisors, whose sum is σ = 2019521710080. Its totient is φ = 136949170176.

The previous prime is 530656019687. The next prime is 530656019783. The reversal of 530656019712 is 217910656035.

530656019712 is a `hidden beast` number, since 5 + 3 + 0 + 6 + 560 + 19 + 71 + 2 = 666.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 4178393793 + ... + 4178393919.

Almost surely, 2530656019712 is an apocalyptic number.

530656019712 is a gapful number since it is divisible by the number (52) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 530656019712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1009760855040).

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

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

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

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

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

The product of its (nonzero) digits is 340200, while the sum is 45.

The spelling of 530656019712 in words is "five hundred thirty billion, six hundred fifty-six million, nineteen thousand, seven hundred twelve".