Base | Representation |
---|---|
bin | 1001011100110111… |
… | …11010011011001001 |
3 | 111002121200202110000 |
4 | 10232123322123021 |
5 | 40342423131200 |
6 | 2155254113213 |
7 | 236511412053 |
oct | 45633723311 |
9 | 14077622400 |
10 | 5074036425 |
11 | 2174185737 |
12 | b9734b809 |
13 | 62b2b1723 |
14 | 361c548d3 |
15 | 1ea6cd300 |
hex | 12e6fa6c9 |
5074036425 has 60 divisors (see below), whose sum is σ = 9553181836. Its totient is φ = 2661724800.
The previous prime is 5074036423. The next prime is 5074036459. The reversal of 5074036425 is 5246304705.
5074036425 is a `hidden beast` number, since 5 + 0 + 7 + 4 + 0 + 3 + 642 + 5 = 666.
It can be written as a sum of positive squares in 6 ways, for example, as 162409536 + 4911626889 = 12744^2 + 70083^2 .
It is not a de Polignac number, because 5074036425 - 21 = 5074036423 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5074036425.
It is not an unprimeable number, because it can be changed into a prime (5074036423) 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 59 ways as a sum of consecutive naturals, for example, 102987 + ... + 144063.
Almost surely, 25074036425 is an apocalyptic number.
It is an amenable number.
5074036425 is a deficient number, since it is larger than the sum of its proper divisors (4479145411).
5074036425 is a wasteful number, since it uses less digits than its factorization.
5074036425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41160 (or 41146 counting only the distinct ones).
The product of its (nonzero) digits is 100800, while the sum is 36.
The square root of 5074036425 is about 71232.2709521464. The cubic root of 5074036425 is about 1718.3746617536.
The spelling of 5074036425 in words is "five billion, seventy-four million, thirty-six thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •