Base | Representation |
---|---|
bin | 10011110000110111… |
… | …110100000100110001 |
3 | 2000202221010010121002 |
4 | 103300313310010301 |
5 | 321430041012431 |
6 | 13425424211345 |
7 | 1350606540443 |
oct | 236067640461 |
9 | 60687103532 |
10 | 21221032241 |
11 | 8aaa7a0682 |
12 | 4142a69b55 |
13 | 2002654316 |
14 | 105452c493 |
15 | 84305d3cb |
hex | 4f0df4131 |
21221032241 has 2 divisors, whose sum is σ = 21221032242. Its totient is φ = 21221032240.
The previous prime is 21221032229. The next prime is 21221032243. The reversal of 21221032241 is 14223012212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18181825600 + 3039206641 = 134840^2 + 55129^2 .
It is a cyclic number.
It is not a de Polignac number, because 21221032241 - 230 = 20147290417 is a prime.
It is a super-2 number, since 2×212210322412 (a number of 21 digits) contains 22 as substring.
Together with 21221032243, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (21221032243) 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 as a sum of consecutive naturals, namely, 10610516120 + 10610516121.
It is an arithmetic number, because the mean of its divisors is an integer number (10610516121).
Almost surely, 221221032241 is an apocalyptic number.
It is an amenable number.
21221032241 is a deficient number, since it is larger than the sum of its proper divisors (1).
21221032241 is an equidigital number, since it uses as much as digits as its factorization.
21221032241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 21221032241 its reverse (14223012212), we get a palindrome (35444044453).
The spelling of 21221032241 in words is "twenty-one billion, two hundred twenty-one million, thirty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •