Base | Representation |
---|---|
bin | 1001010101101000… |
… | …10101100110010101 |
3 | 110221101110120022221 |
4 | 10222310111212111 |
5 | 40231403032300 |
6 | 2145245022341 |
7 | 235143414253 |
oct | 45264254625 |
9 | 13841416287 |
10 | 5013330325 |
11 | 2142992303 |
12 | b7ab549b1 |
13 | 61b848263 |
14 | 357b715d3 |
15 | 1e51db31a |
hex | 12ad15995 |
5013330325 has 6 divisors (see below), whose sum is σ = 6216529634. Its totient is φ = 4010664240.
The previous prime is 5013330299. The next prime is 5013330337. The reversal of 5013330325 is 5230333105.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 58155876 + 4955174449 = 7626^2 + 70393^2 .
It is not a de Polignac number, because 5013330325 - 25 = 5013330293 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25), and also a Moran number because the ratio is a prime number: 200533213 = 5013330325 / (5 + 0 + 1 + 3 + 3 + 3 + 0 + 3 + 2 + 5).
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 5013330325.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 100266582 + ... + 100266631.
Almost surely, 25013330325 is an apocalyptic number.
It is an amenable number.
5013330325 is a deficient number, since it is larger than the sum of its proper divisors (1203199309).
5013330325 is a wasteful number, since it uses less digits than its factorization.
5013330325 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 200533223 (or 200533218 counting only the distinct ones).
The product of its (nonzero) digits is 4050, while the sum is 25.
The square root of 5013330325 is about 70804.8750087167. The cubic root of 5013330325 is about 1711.4942338650.
The spelling of 5013330325 in words is "five billion, thirteen million, three hundred thirty thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •