Base | Representation |
---|---|
bin | 11010010111000… |
… | …00101011100101 |
3 | 120102002010100001 |
4 | 31023200223211 |
5 | 423101340003 |
6 | 33535221301 |
7 | 5323333243 |
oct | 1513405345 |
9 | 512063301 |
10 | 221121253 |
11 | 1038a9741 |
12 | 62077831 |
13 | 36a70ba2 |
14 | 2151d793 |
15 | 1462c61d |
hex | d2e0ae5 |
221121253 has 2 divisors, whose sum is σ = 221121254. Its totient is φ = 221121252.
The previous prime is 221121223. The next prime is 221121269. The reversal of 221121253 is 352121122.
221121253 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 211498849 + 9622404 = 14543^2 + 3102^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-221121253 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 221121253.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (221121223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110560626 + 110560627.
It is an arithmetic number, because the mean of its divisors is an integer number (110560627).
Almost surely, 2221121253 is an apocalyptic number.
It is an amenable number.
221121253 is a deficient number, since it is larger than the sum of its proper divisors (1).
221121253 is an equidigital number, since it uses as much as digits as its factorization.
221121253 is an evil number, because the sum of its binary digits is even.
The product of its digits is 240, while the sum is 19.
The square root of 221121253 is about 14870.1463678069. The cubic root of 221121253 is about 604.7049108484.
Adding to 221121253 its reverse (352121122), we get a palindrome (573242375).
The spelling of 221121253 in words is "two hundred twenty-one million, one hundred twenty-one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •