Base | Representation |
---|---|
bin | 11110000010010111111011… |
… | …010011111001111010100001 |
3 | 122022202001212111212202020202 |
4 | 132002113323103321322201 |
5 | 114303400032002002431 |
6 | 1144543551533314545 |
7 | 36553144201510061 |
oct | 3602277323717241 |
9 | 568661774782222 |
10 | 132104525422241 |
11 | 3910223a708899 |
12 | 129968aa335a55 |
13 | 5893532063c18 |
14 | 2489c70b153a1 |
15 | 104151dc218cb |
hex | 7825fb4f9ea1 |
132104525422241 has 8 divisors (see below), whose sum is σ = 133274198289024. Its totient is φ = 130934863192000.
The previous prime is 132104525422231. The next prime is 132104525422283. The reversal of 132104525422241 is 142224525401231.
It is a happy number.
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-132104525422241 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132104525422195 and 132104525422204.
It is not an unprimeable number, because it can be changed into a prime (132104525422231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23417660 + ... + 28506066.
It is an arithmetic number, because the mean of its divisors is an integer number (16659274786128).
Almost surely, 2132104525422241 is an apocalyptic number.
It is an amenable number.
132104525422241 is a deficient number, since it is larger than the sum of its proper divisors (1169672866783).
132104525422241 is a wasteful number, since it uses less digits than its factorization.
132104525422241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5318271.
The product of its (nonzero) digits is 153600, while the sum is 38.
The spelling of 132104525422241 in words is "one hundred thirty-two trillion, one hundred four billion, five hundred twenty-five million, four hundred twenty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •