Base | Representation |
---|---|
bin | 1011101000010111… |
… | …10100110110101011 |
3 | 121010011121110121101 |
4 | 11310023310312223 |
5 | 100242010140202 |
6 | 2511335222231 |
7 | 310511013640 |
oct | 56413646653 |
9 | 17104543541 |
10 | 6244224427 |
11 | 271477a261 |
12 | 1263217977 |
13 | 78686866c |
14 | 433423dc7 |
15 | 2682ca887 |
hex | 1742f4dab |
6244224427 has 8 divisors (see below), whose sum is σ = 7153210592. Its totient is φ = 5339476800.
The previous prime is 6244224419. The next prime is 6244224443. The reversal of 6244224427 is 7244224426.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6244224427 - 23 = 6244224419 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6244624427) 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 in 7 ways as a sum of consecutive naturals, for example, 1056474 + ... + 1062367.
It is an arithmetic number, because the mean of its divisors is an integer number (894151324).
Almost surely, 26244224427 is an apocalyptic number.
6244224427 is a deficient number, since it is larger than the sum of its proper divisors (908986165).
6244224427 is a wasteful number, since it uses less digits than its factorization.
6244224427 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2119269.
The product of its digits is 172032, while the sum is 37.
The square root of 6244224427 is about 79020.4051305737. The cubic root of 6244224427 is about 1841.4481773120.
Subtracting 6244224427 from its reverse (7244224426), we obtain a palindrome (999999999).
It can be divided in two parts, 624422 and 4427, that added together give a square (628849 = 7932).
The spelling of 6244224427 in words is "six billion, two hundred forty-four million, two hundred twenty-four thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •