Base | Representation |
---|---|
bin | 110000111010101111… |
… | …000000111001011101 |
3 | 12000120120001222220012 |
4 | 300322233000321131 |
5 | 1330032400314100 |
6 | 40044001133005 |
7 | 3536422136321 |
oct | 607257007135 |
9 | 160516058805 |
10 | 52525010525 |
11 | 20303aa9909 |
12 | a21a62a165 |
13 | 4c50c180b0 |
14 | 2783c11981 |
15 | 15763b1135 |
hex | c3abc0e5d |
52525010525 has 12 divisors (see below), whose sum is σ = 70141091412. Its totient is φ = 38787699840.
The previous prime is 52525010513. The next prime is 52525010533. The reversal of 52525010525 is 52501052525.
It can be written as a sum of positive squares in 6 ways, for example, as 1349974564 + 51175035961 = 36742^2 + 226219^2 .
It is not a de Polignac number, because 52525010525 - 220 = 52523961949 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 52525010491 and 52525010500.
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 11 ways as a sum of consecutive naturals, for example, 80807384 + ... + 80808033.
It is an arithmetic number, because the mean of its divisors is an integer number (5845090951).
Almost surely, 252525010525 is an apocalyptic number.
It is an amenable number.
52525010525 is a deficient number, since it is larger than the sum of its proper divisors (17616080887).
52525010525 is a wasteful number, since it uses less digits than its factorization.
52525010525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161615440 (or 161615435 counting only the distinct ones).
The product of its (nonzero) digits is 25000, while the sum is 32.
The spelling of 52525010525 in words is "fifty-two billion, five hundred twenty-five million, ten thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •