Search a number
-
+
132150651560651 = 2326921359407073
BaseRepresentation
bin11110000011000010111000…
…101001001010001011001011
3122022220110221010100100210102
4132003002320221022023023
5114310124013244420101
61145021100552440015
736556366224304523
oct3603027051121313
9568813833310712
10132150651560651
113911a85a711339
12129a38219a900b
1358979a3378149
14248c1a8b68683
15104281d45a86b
hex7830b8a4a2cb

132150651560651 has 8 divisors (see below), whose sum is σ = 138408957839520. Its totient is φ = 125935064096512.

The previous prime is 132150651560647. The next prime is 132150651560663. The reversal of 132150651560651 is 156065156051231.

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 132150651560651 - 22 = 132150651560647 is a prime.

It is a Duffinian number.

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

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

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

Almost surely, 2132150651560651 is an apocalyptic number.

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

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

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

The sum of its prime factors is 21359407365.

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

The spelling of 132150651560651 in words is "one hundred thirty-two trillion, one hundred fifty billion, six hundred fifty-one million, five hundred sixty thousand, six hundred fifty-one".

Divisors: 1 23 269 6187 21359407073 491266362679 5745680502637 132150651560651