Base | Representation |
---|---|
bin | 1001011001010110… |
… | …10100100011110101 |
3 | 111000120011020011201 |
4 | 10230223110203311 |
5 | 40312344134310 |
6 | 2152321332501 |
7 | 236002502623 |
oct | 45453244365 |
9 | 14016136151 |
10 | 5044521205 |
11 | 2159556499 |
12 | b89497131 |
13 | 6251492b9 |
14 | 35bd70513 |
15 | 1e7cece3a |
hex | 12cad48f5 |
5044521205 has 4 divisors (see below), whose sum is σ = 6053425452. Its totient is φ = 4035616960.
The previous prime is 5044521191. The next prime is 5044521227. The reversal of 5044521205 is 5021254405.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5021254405 = 5 ⋅1004250881.
It can be written as a sum of positive squares in 2 ways, for example, as 833938884 + 4210582321 = 28878^2 + 64889^2 .
It is not a de Polignac number, because 5044521205 - 27 = 5044521077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 504452116 + ... + 504452125.
It is an arithmetic number, because the mean of its divisors is an integer number (1513356363).
Almost surely, 25044521205 is an apocalyptic number.
It is an amenable number.
5044521205 is a deficient number, since it is larger than the sum of its proper divisors (1008904247).
5044521205 is a wasteful number, since it uses less digits than its factorization.
5044521205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1008904246.
The product of its (nonzero) digits is 8000, while the sum is 28.
The square root of 5044521205 is about 71024.7928895256. The cubic root of 5044521205 is about 1715.0363026992.
The spelling of 5044521205 in words is "five billion, forty-four million, five hundred twenty-one thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •