Base | Representation |
---|---|
bin | 111101100001101000… |
… | …1000000011111001001 |
3 | 110122001000120011212010 |
4 | 1323003101000133021 |
5 | 4131043002100231 |
6 | 140410350010133 |
7 | 12355116156021 |
oct | 1730321003711 |
9 | 418030504763 |
10 | 132125034441 |
11 | 51041156a44 |
12 | 217344a6949 |
13 | c5c821946a |
14 | 65757d0a81 |
15 | 36846c3546 |
hex | 1ec34407c9 |
132125034441 has 8 divisors (see below), whose sum is σ = 176395801120. Its totient is φ = 87968812032.
The previous prime is 132125034427. The next prime is 132125034443. The reversal of 132125034441 is 144430521231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 132125034441 - 213 = 132125026249 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132125034399 and 132125034408.
It is not an unprimeable number, because it can be changed into a prime (132125034443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28633375 + ... + 28637988.
It is an arithmetic number, because the mean of its divisors is an integer number (22049475140).
Almost surely, 2132125034441 is an apocalyptic number.
It is an amenable number.
132125034441 is a deficient number, since it is larger than the sum of its proper divisors (44270766679).
132125034441 is an equidigital number, since it uses as much as digits as its factorization.
132125034441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57272135.
The product of its (nonzero) digits is 11520, while the sum is 30.
Adding to 132125034441 its reverse (144430521231), we get a palindrome (276555555672).
The spelling of 132125034441 in words is "one hundred thirty-two billion, one hundred twenty-five million, thirty-four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •