Base | Representation |
---|---|
bin | 1110100111001001001… |
… | …01011010101011111101 |
3 | 1202222212210221111101211 |
4 | 13103210211122223331 |
5 | 31211200103021341 |
6 | 1022350020004421 |
7 | 51162203650255 |
oct | 7234445325375 |
9 | 1688783844354 |
10 | 502051220221 |
11 | 183a11909621 |
12 | 81373b30711 |
13 | 384600b9a55 |
14 | 1a429812965 |
15 | d0d5c62181 |
hex | 74e495aafd |
502051220221 has 2 divisors, whose sum is σ = 502051220222. Its totient is φ = 502051220220.
The previous prime is 502051220197. The next prime is 502051220267. The reversal of 502051220221 is 122022150205.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 394994652196 + 107056568025 = 628486^2 + 327195^2 .
It is a cyclic number.
It is not a de Polignac number, because 502051220221 - 27 = 502051220093 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 502051220192 and 502051220201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (502051220821) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 251025610110 + 251025610111.
It is an arithmetic number, because the mean of its divisors is an integer number (251025610111).
Almost surely, 2502051220221 is an apocalyptic number.
It is an amenable number.
502051220221 is a deficient number, since it is larger than the sum of its proper divisors (1).
502051220221 is an equidigital number, since it uses as much as digits as its factorization.
502051220221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 800, while the sum is 22.
Adding to 502051220221 its reverse (122022150205), we get a palindrome (624073370426).
The spelling of 502051220221 in words is "five hundred two billion, fifty-one million, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •