Base | Representation |
---|---|
bin | 11110000101111110100001… |
… | …101100111100011101100000 |
3 | 122100121201222111211122211221 |
4 | 132011332201230330131200 |
5 | 114321424130303440000 |
6 | 1145253421301544424 |
7 | 36610061111052511 |
oct | 3605764154743540 |
9 | 570551874748757 |
10 | 132352130140000 |
11 | 39198250062041 |
12 | 12a16890715114 |
13 | 58b09a1ac9634 |
14 | 2497c3d374a08 |
15 | 1047bb15e761a |
hex | 785fa1b3c760 |
132352130140000 has 120 divisors (see below), whose sum is σ = 344759393435688. Its totient is φ = 49826684160000.
The previous prime is 132352130139991. The next prime is 132352130140001. The reversal of 132352130140000 is 41031253231.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132352130140001) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 194295486 + ... + 194975485.
Almost surely, 2132352130140000 is an apocalyptic number.
132352130140000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132352130140000 is an abundant number, since it is smaller than the sum of its proper divisors (212407263295688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132352130140000 is an equidigital number, since it uses as much as digits as its factorization.
132352130140000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 389271018 (or 389270995 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 132352130140000 its reverse (41031253231), we get a palindrome (132393161393231).
The spelling of 132352130140000 in words is "one hundred thirty-two trillion, three hundred fifty-two billion, one hundred thirty million, one hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •