Search a number
-
+
391349595252 = 22371131127179601
BaseRepresentation
bin1011011000111100100…
…00001110110001110100
31101102010211022021111210
411230132100032301310
522402440444022002
6455441124001420
740163002450050
oct5543620166164
91342124267453
10391349595252
11140a7470a270
1263a1a230270
132ab9a431c55
1414d27390c60
15a2a727596c
hex5b1e40ec74

391349595252 has 384 divisors, whose sum is σ = 1193048801280. Its totient is φ = 96888960000.

The previous prime is 391349595229. The next prime is 391349595289. The reversal of 391349595252 is 252595943193.

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

It is a congruent number.

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 127 ways as a sum of consecutive naturals, for example, 651163752 + ... + 651164352.

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

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

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

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

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

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

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

The product of its digits is 13122000, while the sum is 57.

The spelling of 391349595252 in words is "three hundred ninety-one billion, three hundred forty-nine million, five hundred ninety-five thousand, two hundred fifty-two".