Base | Representation |
---|---|
bin | 10111111110110… |
… | …00000101110101 |
3 | 112000112010221010 |
4 | 23333120011311 |
5 | 402444210000 |
6 | 31543342433 |
7 | 4661600262 |
oct | 1377300565 |
9 | 460463833 |
10 | 201163125 |
11 | a3607919 |
12 | 57451a19 |
13 | 328a3847 |
14 | 1ca06269 |
15 | 129d8d50 |
hex | bfd8175 |
201163125 has 40 divisors (see below), whose sum is σ = 354936384. Its totient is φ = 100960000.
The previous prime is 201163121. The next prime is 201163141. The reversal of 201163125 is 521361102.
It is not a de Polignac number, because 201163125 - 22 = 201163121 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201163121) 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 39 ways as a sum of consecutive naturals, for example, 28720 + ... + 35030.
Almost surely, 2201163125 is an apocalyptic number.
201163125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
201163125 is a deficient number, since it is larger than the sum of its proper divisors (153773259).
201163125 is an equidigital number, since it uses as much as digits as its factorization.
201163125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6351 (or 6336 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 21.
The square root of 201163125 is about 14183.1986871791. The cubic root of 201163125 is about 585.9350231006.
The spelling of 201163125 in words is "two hundred one million, one hundred sixty-three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •