Search a number
-
+
132591469961 = 1719410499907
BaseRepresentation
bin111101101111100010…
…0010100010110001001
3110200020112020120002202
41323133010110112021
54133021404014321
6140524531205545
712402511620236
oct1733704242611
9420215216082
10132591469961
1151260478945
12218447468b5
13c670a4c002
1465bb72a78d
1536b060b70b
hex1edf114589

132591469961 has 8 divisors (see below), whose sum is σ = 147779966880. Its totient is φ = 118223972928.

The previous prime is 132591469909. The next prime is 132591470027. The reversal of 132591469961 is 169964195231.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-132591469961 is a prime.

It is a Duffinian number.

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

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

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

Almost surely, 2132591469961 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 410499943.

The product of its digits is 3149280, while the sum is 56.

The spelling of 132591469961 in words is "one hundred thirty-two billion, five hundred ninety-one million, four hundred sixty-nine thousand, nine hundred sixty-one".

Divisors: 1 17 19 323 410499907 6978498419 7799498233 132591469961