Base | Representation |
---|---|
bin | 111001010110001000111110… |
… | …0010101111001000101010001 |
3 | 2110011000002202210011121021102 |
4 | 1302230101330111321011101 |
5 | 1012103410110124200131 |
6 | 4544451241420434145 |
7 | 211151105261433506 |
oct | 16254217425710521 |
9 | 2404002683147242 |
10 | 504420225225041 |
11 | 1367a6463a27754 |
12 | 486a80289a8955 |
13 | 1885c814052128 |
14 | 8c7c0d7b114ad |
15 | 3d4b1dabab1cb |
hex | 1cac47c579151 |
504420225225041 has 16 divisors (see below), whose sum is σ = 522403773840000. Its totient is φ = 486476049486336.
The previous prime is 504420225225017. The next prime is 504420225225061. The reversal of 504420225225041 is 140522522024405.
It is a de Polignac number, because none of the positive numbers 2k-504420225225041 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 504420225224986 and 504420225225004.
It is not an unprimeable number, because it can be changed into a prime (504420225225011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 510819980 + ... + 511806498.
It is an arithmetic number, because the mean of its divisors is an integer number (32650235865000).
Almost surely, 2504420225225041 is an apocalyptic number.
It is an amenable number.
504420225225041 is a deficient number, since it is larger than the sum of its proper divisors (17983548614959).
504420225225041 is a wasteful number, since it uses less digits than its factorization.
504420225225041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1006456.
The product of its (nonzero) digits is 256000, while the sum is 38.
Adding to 504420225225041 its reverse (140522522024405), we get a palindrome (644942747249446).
The spelling of 504420225225041 in words is "five hundred four trillion, four hundred twenty billion, two hundred twenty-five million, two hundred twenty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •