Base | Representation |
---|---|
bin | 11110001100000101100110… |
… | …111010001101111010111011 |
3 | 122102002212212111012011000010 |
4 | 132030011212322031322323 |
5 | 114400314124420334101 |
6 | 1150214345445513003 |
7 | 36652315120530030 |
oct | 3614054672157273 |
9 | 572085774164003 |
10 | 132772050558651 |
11 | 3933a3461a8849 |
12 | 12a84143112763 |
13 | 591147349a93a |
14 | 24b02b7025387 |
15 | 1053a8bc8c2d6 |
hex | 78c166e8debb |
132772050558651 has 32 divisors (see below), whose sum is σ = 202860992706048. Its totient is φ = 75666861987840.
The previous prime is 132772050558643. The next prime is 132772050558689. The reversal of 132772050558651 is 156855050277231.
It is not a de Polignac number, because 132772050558651 - 23 = 132772050558643 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132772050558591 and 132772050558600.
It is not an unprimeable number, because it can be changed into a prime (132772050548651) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7692376 + ... + 18019898.
It is an arithmetic number, because the mean of its divisors is an integer number (6339406022064).
Almost surely, 2132772050558651 is an apocalyptic number.
132772050558651 is a deficient number, since it is larger than the sum of its proper divisors (70088942147397).
132772050558651 is a wasteful number, since it uses less digits than its factorization.
132772050558651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10329171.
The product of its (nonzero) digits is 17640000, while the sum is 57.
The spelling of 132772050558651 in words is "one hundred thirty-two trillion, seven hundred seventy-two billion, fifty million, five hundred fifty-eight thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •