Search a number
-
+
530400113320 = 2357112917873323
BaseRepresentation
bin1111011011111100100…
…11110111001010101000
31212201001111101110220111
413231332103313022220
532142224412111240
61043355031104104
753214544401340
oct7557623671250
91781044343814
10530400113320
11194a3a0445a0
1286965b12034
133b02a393bcc
141b958861d20
15dbe49441ea
hex7b7e4f72a8

530400113320 has 256 divisors, whose sum is σ = 1540506470400. Its totient is φ = 159481512960.

The previous prime is 530400113317. The next prime is 530400113333. The reversal of 530400113320 is 23311004035.

It is a Harshad number since it is a multiple of its sum of digits (22).

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

It is an unprimeable number.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 159613179 + ... + 159616501.

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

Almost surely, 2530400113320 is an apocalyptic number.

It is an amenable number.

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

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

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

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

530400113320 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 1080, while the sum is 22.

Adding to 530400113320 its reverse (23311004035), we get a palindrome (553711117355).

The spelling of 530400113320 in words is "five hundred thirty billion, four hundred million, one hundred thirteen thousand, three hundred twenty".