Search a number
-
+
39052683551 = 733231678891
BaseRepresentation
bin100100010111101110…
…001010100100011111
310201210122111212122002
4210113232022210133
51114434441333201
625535054312515
72551522222160
oct442756124437
9121718455562
1039052683551
1115620249192
12769a7b873b
1338b4a3009b
141c66855767
15103876076b
hex917b8a91f

39052683551 has 8 divisors (see below), whose sum is σ = 44645096064. Its totient is φ = 33463635480.

The previous prime is 39052683539. The next prime is 39052683583. The reversal of 39052683551 is 15538625093.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 39052683551 - 210 = 39052682527 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

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

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

Almost surely, 239052683551 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1682221.

The product of its (nonzero) digits is 972000, while the sum is 47.

The spelling of 39052683551 in words is "thirty-nine billion, fifty-two million, six hundred eighty-three thousand, five hundred fifty-one".

Divisors: 1 7 3323 23261 1678891 11752237 5578954793 39052683551