Search a number
-
+
3952663250073 = 310912087655199
BaseRepresentation
bin111001100001001101000…
…101101100010010011001
3111222212111220020122120220
4321201031011230102121
51004230023243000243
612223454535110253
7555366452162616
oct71411505542231
914885456218526
103952663250073
1112943513a483a
1253a076b12389
13228971a46035
14d944a5d750d
156cc4033b783
hex3984d16c499

3952663250073 has 8 divisors (see below), whose sum is σ = 5318568288000. Its totient is φ = 2610933522768.

The previous prime is 3952663250047. The next prime is 3952663250077. The reversal of 3952663250073 is 3700523662593.

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

It is not a de Polignac number, because 3952663250073 - 216 = 3952663184537 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (3952663250077) 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, 6043827273 + ... + 6043827926.

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

Almost surely, 23952663250073 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 12087655311.

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

The spelling of 3952663250073 in words is "three trillion, nine hundred fifty-two billion, six hundred sixty-three million, two hundred fifty thousand, seventy-three".

Divisors: 1 3 109 327 12087655199 36262965597 1317554416691 3952663250073