Base | Representation |
---|---|
bin | 11000000001100… |
… | …01010110010101 |
3 | 112001012201102212 |
4 | 30000301112111 |
5 | 403042404400 |
6 | 31555243205 |
7 | 4664652206 |
oct | 1400612625 |
9 | 461181385 |
10 | 201528725 |
11 | a3837572 |
12 | 575a9505 |
13 | 329a1088 |
14 | 1ca9d5ad |
15 | 12a5c335 |
hex | c031595 |
201528725 has 12 divisors (see below), whose sum is σ = 263048640. Its totient is φ = 152737200.
The previous prime is 201528709. The next prime is 201528749. The reversal of 201528725 is 527825102.
It is a happy number.
It is not a de Polignac number, because 201528725 - 24 = 201528709 is a prime.
It is a super-2 number, since 2×2015287252 = 81227654000251250, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201528691 and 201528700.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 211661 + ... + 212610.
It is an arithmetic number, because the mean of its divisors is an integer number (21920720).
Almost surely, 2201528725 is an apocalyptic number.
201528725 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
201528725 is a deficient number, since it is larger than the sum of its proper divisors (61519915).
201528725 is a wasteful number, since it uses less digits than its factorization.
201528725 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 424300 (or 424295 counting only the distinct ones).
The product of its (nonzero) digits is 11200, while the sum is 32.
The square root of 201528725 is about 14196.0813254926. The cubic root of 201528725 is about 586.2897736710.
The spelling of 201528725 in words is "two hundred one million, five hundred twenty-eight thousand, seven hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •