Base | Representation |
---|---|
bin | 1111110101101100000… |
… | …11100001001101000001 |
3 | 1221000201122102102022021 |
4 | 13322312003201031001 |
5 | 32404030341130131 |
6 | 1054002240441441 |
7 | 54214166561611 |
oct | 7726603411501 |
9 | 1830648372267 |
10 | 544220255041 |
11 | 19a891167621 |
12 | 89582319281 |
13 | 3c42064b568 |
14 | 1c4aa0baa41 |
15 | e252d9ae11 |
hex | 7eb60e1341 |
544220255041 has 2 divisors, whose sum is σ = 544220255042. Its totient is φ = 544220255040.
The previous prime is 544220255003. The next prime is 544220255071. The reversal of 544220255041 is 140552022445.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 437767489600 + 106452765441 = 661640^2 + 326271^2 .
It is a cyclic number.
It is not a de Polignac number, because 544220255041 - 219 = 544219730753 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 544220254988 and 544220255006.
It is not a weakly prime, because it can be changed into another prime (544220255071) 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, 272110127520 + 272110127521.
It is an arithmetic number, because the mean of its divisors is an integer number (272110127521).
Almost surely, 2544220255041 is an apocalyptic number.
It is an amenable number.
544220255041 is a deficient number, since it is larger than the sum of its proper divisors (1).
544220255041 is an equidigital number, since it uses as much as digits as its factorization.
544220255041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64000, while the sum is 34.
Adding to 544220255041 its reverse (140552022445), we get a palindrome (684772277486).
The spelling of 544220255041 in words is "five hundred forty-four billion, two hundred twenty million, two hundred fifty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •