Search a number
-
+
390502725648 = 243723433533329
BaseRepresentation
bin1011010111010111100…
…01101011100000010000
31101022221210202211210220
411223223301223200100
522344222144210043
6455221112353040
740133010254340
oct5535361534020
91338853684726
10390502725648
1114067a676632
12638226a5780
132aa93b4b789
1414c86b04d20
15a257c41483
hex5aebc6b810

390502725648 has 320 divisors, whose sum is σ = 1234875248640. Its totient is φ = 103912833024.

The previous prime is 390502725631. The next prime is 390502725661. The reversal of 390502725648 is 846527205093.

It is a happy number.

It is a self number, because there is not a number n which added to its sum of digits gives 390502725648.

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 in 63 ways as a sum of consecutive naturals, for example, 117301648 + ... + 117304976.

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

Almost surely, 2390502725648 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 390502725648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (617437624320).

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

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

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

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

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

The product of its (nonzero) digits is 3628800, while the sum is 51.

The spelling of 390502725648 in words is "three hundred ninety billion, five hundred two million, seven hundred twenty-five thousand, six hundred forty-eight".