Search a number
-
+
132170612570643 = 3245917916580259
BaseRepresentation
bin11110000011010101011110…
…011010010111101000010011
3122022222101110020111201210210
4132003111132122113220103
5114310440403304230033
61145034201410255203
736561003664141113
oct3603253632275023
9568871406451723
10132170612570643
113912827312a609
12129a7672887503
135899834950b6a
14248d13dbc1043
1510430daa73d63
hex78355e697a13

132170612570643 has 8 divisors (see below), whose sum is σ = 176299149758400. Its totient is φ = 88077908548328.

The previous prime is 132170612570641. The next prime is 132170612570791. The reversal of 132170612570643 is 346075216071231.

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 132170612570643 - 21 = 132170612570641 is a prime.

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

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

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

Almost surely, 2132170612570643 is an apocalyptic number.

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

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

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

The sum of its prime factors is 17916582721.

The product of its (nonzero) digits is 1270080, while the sum is 48.

The spelling of 132170612570643 in words is "one hundred thirty-two trillion, one hundred seventy billion, six hundred twelve million, five hundred seventy thousand, six hundred forty-three".

Divisors: 1 3 2459 7377 17916580259 53749740777 44056870856881 132170612570643