Search a number
-
+
320114352153045 = 3521340956810203
BaseRepresentation
bin100100011001001000110111…
…0001111110110000111010101
31112222102122002121011100111110
41020302101232033312013111
5313424223143122344140
63052454300405525233
7124266333031001202
oct11062215617660725
91488378077140443
10320114352153045
1192aa880947666a
122baa0380a13819
1310980866765328
14590988dc98ca9
152701d97924380
hex123246e3f61d5

320114352153045 has 8 divisors (see below), whose sum is σ = 512182963444896. Its totient is φ = 170727654481616.

The previous prime is 320114352152993. The next prime is 320114352153121. The reversal of 320114352153045 is 540351253411023.

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 320114352153045 - 211 = 320114352150997 is a prime.

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 2320114352153045 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 21340956810211.

The product of its (nonzero) digits is 216000, while the sum is 39.

The spelling of 320114352153045 in words is "three hundred twenty trillion, one hundred fourteen billion, three hundred fifty-two million, one hundred fifty-three thousand, forty-five".

Divisors: 1 3 5 15 21340956810203 64022870430609 106704784051015 320114352153045