Search a number
-
+
39049510132 = 2243613223841
BaseRepresentation
bin100100010111100010…
…000011110011110100
310201210102112122112001
4210113202003303310
51114433133311012
625534502305044
72551453234213
oct442742036364
9121712478461
1039049510132
1115619480a26
127699728184
1338b418b819
141c6626b07a
151038335357
hex917883cf4

39049510132 has 12 divisors (see below), whose sum is σ = 68338514916. Its totient is φ = 19524220160.

The previous prime is 39049510111. The next prime is 39049510133. The reversal of 39049510132 is 23101594093.

It can be written as a sum of positive squares in 2 ways, for example, as 10503380196 + 28546129936 = 102486^2 + 168956^2 .

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (39049510133) by changing a digit.

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, 62532 + ... + 286372.

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

Almost surely, 239049510132 is an apocalyptic number.

It is an amenable number.

39049510132 is a deficient number, since it is larger than the sum of its proper divisors (29289004784).

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

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

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

The product of its (nonzero) digits is 29160, while the sum is 37.

The spelling of 39049510132 in words is "thirty-nine billion, forty-nine million, five hundred ten thousand, one hundred thirty-two".

Divisors: 1 2 4 43613 87226 174452 223841 447682 895364 9762377533 19524755066 39049510132