Search a number
-
+
39231620637681 = 341318956265347
BaseRepresentation
bin10001110101110010100101…
…10011111110001111110001
312010220111200002121002122210
420322321102303332033301
520120232324340401211
6215234431355522333
711156251063163523
oct1072712263761761
9163814602532583
1039231620637681
11115560450a149a
1244974264593a9
1318b76ab6936b4
14998b6b905a13
1548078797c9a6
hex23ae52cfe3f1

39231620637681 has 8 divisors (see below), whose sum is σ = 53584652578464. Its totient is φ = 25516501227680.

The previous prime is 39231620637679. The next prime is 39231620637689. The reversal of 39231620637681 is 18673602613293.

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

It is not a de Polignac number, because 39231620637681 - 21 = 39231620637679 is a prime.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 159478132551 + ... + 159478132796.

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

Almost surely, 239231620637681 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 318956265391.

The product of its (nonzero) digits is 11757312, while the sum is 57.

The spelling of 39231620637681 in words is "thirty-nine trillion, two hundred thirty-one billion, six hundred twenty million, six hundred thirty-seven thousand, six hundred eighty-one".

Divisors: 1 3 41 123 318956265347 956868796041 13077206879227 39231620637681