Base | Representation |
---|---|
bin | 1001110111110100… |
… | …00101101001011101 |
3 | 111200100222110111121 |
4 | 10323322011221131 |
5 | 41323303104100 |
6 | 2233530250541 |
7 | 245224454230 |
oct | 47372055135 |
9 | 14610873447 |
10 | 5300050525 |
11 | 227a816450 |
12 | 103ab86a51 |
13 | 666076693 |
14 | 383c89417 |
15 | 21047551a |
hex | 13be85a5d |
5300050525 has 48 divisors (see below), whose sum is σ = 8393712768. Its totient is φ = 3223296000.
The previous prime is 5300050519. The next prime is 5300050571. The reversal of 5300050525 is 5250500035.
It is not a de Polignac number, because 5300050525 - 217 = 5299919453 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a self number, because there is not a number n which added to its sum of digits gives 5300050525.
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 45349 + ... + 112501.
It is an arithmetic number, because the mean of its divisors is an integer number (174869016).
Almost surely, 25300050525 is an apocalyptic number.
5300050525 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5300050525 is a deficient number, since it is larger than the sum of its proper divisors (3093662243).
5300050525 is a wasteful number, since it uses less digits than its factorization.
5300050525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67222 (or 67217 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 25.
The square root of 5300050525 is about 72801.4458991029. The cubic root of 5300050525 is about 1743.5189415629.
The spelling of 5300050525 in words is "five billion, three hundred million, fifty thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •