Base | Representation |
---|---|
bin | 100000011100110… |
… | …011000010110101 |
3 | 1101221102101212111 |
4 | 200130303002311 |
5 | 2103332420041 |
6 | 130004451021 |
7 | 16330331245 |
oct | 4034630265 |
9 | 1357371774 |
10 | 544420021 |
11 | 25a346902 |
12 | 1323a9a71 |
13 | 88a38732 |
14 | 52439b25 |
15 | 32bde981 |
hex | 207330b5 |
544420021 has 8 divisors (see below), whose sum is σ = 547875200. Its totient is φ = 540972432.
The previous prime is 544420013. The next prime is 544420061. The reversal of 544420021 is 120024445.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 544420021 - 23 = 544420013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 544419974 and 544420001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (544420061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 216256 + ... + 218758.
It is an arithmetic number, because the mean of its divisors is an integer number (68484400).
Almost surely, 2544420021 is an apocalyptic number.
It is an amenable number.
544420021 is a deficient number, since it is larger than the sum of its proper divisors (3455179).
544420021 is a wasteful number, since it uses less digits than its factorization.
544420021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3795.
The product of its (nonzero) digits is 1280, while the sum is 22.
The square root of 544420021 is about 23332.8099679400. The cubic root of 544420021 is about 816.5410620285.
Adding to 544420021 its reverse (120024445), we get a palindrome (664444466).
The spelling of 544420021 in words is "five hundred forty-four million, four hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •