Base | Representation |
---|---|
bin | 111001010110001110100110… |
… | …0000011101010001100111101 |
3 | 2110011001020221022001210212002 |
4 | 1302230131030003222030331 |
5 | 1012104104322302303041 |
6 | 4544500555521552045 |
7 | 211152013431612602 |
oct | 16254351403521475 |
9 | 2404036838053762 |
10 | 504432300041021 |
11 | 13680059a939710 |
12 | 486aa4387a5625 |
13 | 188609b9850561 |
14 | 8c7c9216466a9 |
15 | 3d4b695ca959b |
hex | 1cac74c0ea33d |
504432300041021 has 8 divisors (see below), whose sum is σ = 550357128648288. Its totient is φ = 458518695898000.
The previous prime is 504432300040987. The next prime is 504432300041041. The reversal of 504432300041021 is 120140003234405.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-504432300041021 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (504432300041041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2806022090 + ... + 2806201851.
It is an arithmetic number, because the mean of its divisors is an integer number (68794641081036).
Almost surely, 2504432300041021 is an apocalyptic number.
It is an amenable number.
504432300041021 is a deficient number, since it is larger than the sum of its proper divisors (45924828607267).
504432300041021 is a wasteful number, since it uses less digits than its factorization.
504432300041021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5612232123.
The product of its (nonzero) digits is 11520, while the sum is 29.
Adding to 504432300041021 its reverse (120140003234405), we get a palindrome (624572303275426).
The spelling of 504432300041021 in words is "five hundred four trillion, four hundred thirty-two billion, three hundred million, forty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •