Base | Representation |
---|---|
bin | 11010010110011… |
… | …01001010101001 |
3 | 120101221001200121 |
4 | 31023031022221 |
5 | 423041310241 |
6 | 33533403241 |
7 | 5322551224 |
oct | 1513151251 |
9 | 511831617 |
10 | 221041321 |
11 | 103854686 |
12 | 62039521 |
13 | 36a436a7 |
14 | 214dc5bb |
15 | 14613ad1 |
hex | d2cd2a9 |
221041321 has 2 divisors, whose sum is σ = 221041322. Its totient is φ = 221041320.
The previous prime is 221041319. The next prime is 221041357. The reversal of 221041321 is 123140122.
221041321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 201327721 + 19713600 = 14189^2 + 4440^2 .
It is a cyclic number.
It is not a de Polignac number, because 221041321 - 21 = 221041319 is a prime.
Together with 221041319, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 221041295 and 221041304.
It is not a weakly prime, because it can be changed into another prime (221041621) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110520660 + 110520661.
It is an arithmetic number, because the mean of its divisors is an integer number (110520661).
Almost surely, 2221041321 is an apocalyptic number.
It is an amenable number.
221041321 is a deficient number, since it is larger than the sum of its proper divisors (1).
221041321 is an equidigital number, since it uses as much as digits as its factorization.
221041321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 221041321 is about 14867.4584579880. The cubic root of 221041321 is about 604.6320381634.
Adding to 221041321 its reverse (123140122), we get a palindrome (344181443).
The spelling of 221041321 in words is "two hundred twenty-one million, forty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •