Base | Representation |
---|---|
bin | 1011011001011101101101… |
… | …1001101101101000011001 |
3 | 1122101001112122010212202021 |
4 | 2312113123121231220121 |
5 | 3120311220220200431 |
6 | 42353100103334441 |
7 | 2432262064050553 |
oct | 266273331555031 |
9 | 48331478125667 |
10 | 12532100553241 |
11 | 3aa191a062045 |
12 | 14a497b151421 |
13 | 6cba06155359 |
14 | 3147b21dc4d3 |
15 | 16aec6ca3b11 |
hex | b65db66da19 |
12532100553241 has 8 divisors (see below), whose sum is σ = 12810918720384. Its totient is φ = 12253789791600.
The previous prime is 12532100553163. The next prime is 12532100553251. The reversal of 12532100553241 is 14235500123521.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12532100553241 - 243 = 3736007531033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12532100553197 and 12532100553206.
It is not an unprimeable number, because it can be changed into a prime (12532100553251) 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, 126801430 + ... + 126900223.
It is an arithmetic number, because the mean of its divisors is an integer number (1601364840048).
Almost surely, 212532100553241 is an apocalyptic number.
It is an amenable number.
12532100553241 is a deficient number, since it is larger than the sum of its proper divisors (278818167143).
12532100553241 is a wasteful number, since it uses less digits than its factorization.
12532100553241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 253702751.
The product of its (nonzero) digits is 36000, while the sum is 34.
Adding to 12532100553241 its reverse (14235500123521), we get a palindrome (26767600676762).
The spelling of 12532100553241 in words is "twelve trillion, five hundred thirty-two billion, one hundred million, five hundred fifty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •