Base | Representation |
---|---|
bin | 1011101101100010001… |
… | …1000000110010001101 |
3 | 201020100002012212200210 |
4 | 2323120203000302031 |
5 | 11244030044140100 |
6 | 232233011313033 |
7 | 20351650656411 |
oct | 2733043006215 |
9 | 636302185623 |
10 | 201201552525 |
11 | 78369038416 |
12 | 32bb1bab779 |
13 | 15c862381bc |
14 | 9a498d6d41 |
15 | 5378bb9c50 |
hex | 2ed88c0c8d |
201201552525 has 12 divisors (see below), whose sum is σ = 332653233632. Its totient is φ = 107307494640.
The previous prime is 201201552509. The next prime is 201201552529. The reversal of 201201552525 is 525255102102.
It is not a de Polignac number, because 201201552525 - 24 = 201201552509 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201201552492 and 201201552501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201201552529) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1341343609 + ... + 1341343758.
Almost surely, 2201201552525 is an apocalyptic number.
201201552525 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
201201552525 is a deficient number, since it is larger than the sum of its proper divisors (131451681107).
201201552525 is a wasteful number, since it uses less digits than its factorization.
201201552525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2682687380 (or 2682687375 counting only the distinct ones).
The product of its (nonzero) digits is 10000, while the sum is 30.
Adding to 201201552525 its reverse (525255102102), we get a palindrome (726456654627).
The spelling of 201201552525 in words is "two hundred one billion, two hundred one million, five hundred fifty-two thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •