Base | Representation |
---|---|
bin | 1001011010010100… |
… | …01111000010010101 |
3 | 111001010101221112221 |
4 | 10231022033002111 |
5 | 40321433000140 |
6 | 2153211142341 |
7 | 236131414156 |
oct | 45512170225 |
9 | 14033357487 |
10 | 5052625045 |
11 | 2163090a86 |
12 | b901449b1 |
13 | 626a25a80 |
14 | 35d07d92d |
15 | 1e889e14a |
hex | 12d28f095 |
5052625045 has 8 divisors (see below), whose sum is σ = 6529546296. Its totient is φ = 3731169216.
The previous prime is 5052625007. The next prime is 5052625051. The reversal of 5052625045 is 5405262505.
It can be written as a sum of positive squares in 4 ways, for example, as 619462321 + 4433162724 = 24889^2 + 66582^2 .
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 5052625045 - 211 = 5052622997 is a prime.
It is a super-2 number, since 2×50526250452 = 51058039690722504050, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5052625045.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38866282 + ... + 38866411.
It is an arithmetic number, because the mean of its divisors is an integer number (816193287).
Almost surely, 25052625045 is an apocalyptic number.
It is an amenable number.
5052625045 is a deficient number, since it is larger than the sum of its proper divisors (1476921251).
5052625045 is a wasteful number, since it uses less digits than its factorization.
5052625045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77732711.
The product of its (nonzero) digits is 60000, while the sum is 34.
The square root of 5052625045 is about 71081.8193703566. The cubic root of 5052625045 is about 1715.9541925212.
The spelling of 5052625045 in words is "five billion, fifty-two million, six hundred twenty-five thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •