Base | Representation |
---|---|
bin | 11110000010010111100001… |
… | …011001100010111111000000 |
3 | 122022202000202012212020121210 |
4 | 132002113201121202333000 |
5 | 114303343134204143233 |
6 | 1144543440443450120 |
7 | 36553130342413410 |
oct | 3602274131427700 |
9 | 568660665766553 |
10 | 132104090693568 |
11 | 391020372827a4 |
12 | 129967a8826940 |
13 | 5893492c83216 |
14 | 2489c2d0b0640 |
15 | 10414e599d163 |
hex | 7825e1662fc0 |
132104090693568 has 224 divisors, whose sum is σ = 413269107724800. Its totient is φ = 36439235997696.
The previous prime is 132104090693567. The next prime is 132104090693633. The reversal of 132104090693568 is 865396090401231.
It is a tau number, because it is divible by the number of its divisors (224).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132104090693567) 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, 451156746 + ... + 451449462.
Almost surely, 2132104090693568 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 132104090693568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (206634553862400).
132104090693568 is an abundant number, since it is smaller than the sum of its proper divisors (281165017031232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132104090693568 is a wasteful number, since it uses less digits than its factorization.
132104090693568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 304347 (or 304337 counting only the distinct ones).
The product of its (nonzero) digits is 8398080, while the sum is 57.
The spelling of 132104090693568 in words is "one hundred thirty-two trillion, one hundred four billion, ninety million, six hundred ninety-three thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •