Base | Representation |
---|---|
bin | 1001100111101000111110… |
… | …10110111100111011101001 |
3 | 2202220020012200001200202212 |
4 | 10303310133112330323221 |
5 | 10233033313422340431 |
6 | 112553355254334505 |
7 | 4312162002450245 |
oct | 463643726747351 |
9 | 82806180050685 |
10 | 21153240043241 |
11 | 68160475a4569 |
12 | 245778135a435 |
13 | ba598517a977 |
14 | 531b724a5425 |
15 | 26a39e88972b |
hex | 133d1f5bcee9 |
21153240043241 has 2 divisors, whose sum is σ = 21153240043242. Its totient is φ = 21153240043240.
The previous prime is 21153240043121. The next prime is 21153240043307. The reversal of 21153240043241 is 14234004235112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18109314294016 + 3043925749225 = 4255504^2 + 1744685^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21153240043241 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21153240043198 and 21153240043207.
It is not a weakly prime, because it can be changed into another prime (21153240042241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10576620021620 + 10576620021621.
It is an arithmetic number, because the mean of its divisors is an integer number (10576620021621).
Almost surely, 221153240043241 is an apocalyptic number.
It is an amenable number.
21153240043241 is a deficient number, since it is larger than the sum of its proper divisors (1).
21153240043241 is an equidigital number, since it uses as much as digits as its factorization.
21153240043241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23040, while the sum is 32.
Adding to 21153240043241 its reverse (14234004235112), we get a palindrome (35387244278353).
The spelling of 21153240043241 in words is "twenty-one trillion, one hundred fifty-three billion, two hundred forty million, forty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •