Base | Representation |
---|---|
bin | 11000000011001… |
… | …11111001010100 |
3 | 112001122001220210 |
4 | 30001213321110 |
5 | 403122032043 |
6 | 32004125420 |
7 | 4666602453 |
oct | 1401477124 |
9 | 461561823 |
10 | 201752148 |
11 | a397a414 |
12 | 57696870 |
13 | 32a4b990 |
14 | 1cb1ab9a |
15 | 12aa3633 |
hex | c067e54 |
201752148 has 24 divisors (see below), whose sum is σ = 506967328. Its totient is φ = 62077536.
The previous prime is 201752147. The next prime is 201752149. The reversal of 201752148 is 841257102.
201752148 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (201752147) and next prime (201752149).
It is a super-2 number, since 2×2017521482 = 81407858445227808, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201752147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 646486 + ... + 646797.
Almost surely, 2201752148 is an apocalyptic number.
It is an amenable number.
201752148 is an abundant number, since it is smaller than the sum of its proper divisors (305215180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201752148 is a wasteful number, since it uses less digits than its factorization.
201752148 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1293303 (or 1293301 counting only the distinct ones).
The product of its (nonzero) digits is 4480, while the sum is 30.
The square root of 201752148 is about 14203.9483243217. The cubic root of 201752148 is about 586.5063552736.
The spelling of 201752148 in words is "two hundred one million, seven hundred fifty-two thousand, one hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •