Base | Representation |
---|---|
bin | 1011111100110… |
… | …1111010111101 |
3 | 10111022200122222 |
4 | 2333031322331 |
5 | 100313022100 |
6 | 4550215125 |
7 | 1146032321 |
oct | 277157275 |
9 | 114280588 |
10 | 50126525 |
11 | 26327889 |
12 | 149544a5 |
13 | a500b87 |
14 | 692b981 |
15 | 4602485 |
hex | 2fcdebd |
50126525 has 6 divisors (see below), whose sum is σ = 62156922. Its totient is φ = 40101200.
The previous prime is 50126513. The next prime is 50126537. The reversal of 50126525 is 52562105.
It is an interprime number because it is at equal distance from previous prime (50126513) and next prime (50126537).
It can be written as a sum of positive squares in 3 ways, for example, as 2502724 + 47623801 = 1582^2 + 6901^2 .
It is not a de Polignac number, because 50126525 - 24 = 50126509 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50126494 and 50126503.
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 5 ways as a sum of consecutive naturals, for example, 1002506 + ... + 1002555.
It is an arithmetic number, because the mean of its divisors is an integer number (10359487).
Almost surely, 250126525 is an apocalyptic number.
It is an amenable number.
50126525 is a deficient number, since it is larger than the sum of its proper divisors (12030397).
50126525 is a wasteful number, since it uses less digits than its factorization.
50126525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2005071 (or 2005066 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 26.
The square root of 50126525 is about 7080.0088276781. The cubic root of 50126525 is about 368.7136361728.
The spelling of 50126525 in words is "fifty million, one hundred twenty-six thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •