Base | Representation |
---|---|
bin | 11101000101101… |
… | …11001111111101 |
3 | 122000011111210222 |
4 | 32202313033331 |
5 | 444432121341 |
6 | 40114111125 |
7 | 6022065134 |
oct | 1642671775 |
9 | 560144728 |
10 | 244020221 |
11 | 11581a005 |
12 | 6987b4a5 |
13 | 3b72a983 |
14 | 245a091b |
15 | 1665244b |
hex | e8b73fd |
244020221 has 2 divisors, whose sum is σ = 244020222. Its totient is φ = 244020220.
The previous prime is 244020197. The next prime is 244020229. The reversal of 244020221 is 122020442.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 144240100 + 99780121 = 12010^2 + 9989^2 .
It is a cyclic number.
It is not a de Polignac number, because 244020221 - 222 = 239825917 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 244020221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (244020229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 122010110 + 122010111.
It is an arithmetic number, because the mean of its divisors is an integer number (122010111).
Almost surely, 2244020221 is an apocalyptic number.
It is an amenable number.
244020221 is a deficient number, since it is larger than the sum of its proper divisors (1).
244020221 is an equidigital number, since it uses as much as digits as its factorization.
244020221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 17.
The square root of 244020221 is about 15621.1465968411. The cubic root of 244020221 is about 624.8972383583.
Adding to 244020221 its reverse (122020442), we get a palindrome (366040663).
The spelling of 244020221 in words is "two hundred forty-four million, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •