Search a number
-
+
201150152 = 2373591967
BaseRepresentation
bin10111111110101…
…00111011001000
3112000111111010122
423333110323020
5402443301102
631543202412
74661514410
oct1377247310
9460444118
10201150152
11a35a90a5
1257446408
133289a978
141ca01640
15129d50a2
hexbfd4ec8

201150152 has 16 divisors (see below), whose sum is σ = 431036160. Its totient is φ = 86207184.

The previous prime is 201150151. The next prime is 201150163. The reversal of 201150152 is 251051102.

It is a super-2 number, since 2×2011501522 = 80922767299246208, which contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 201150152.

It is not an unprimeable number, because it can be changed into a prime (201150151) 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 3 ways as a sum of consecutive naturals, for example, 1795928 + ... + 1796039.

It is an arithmetic number, because the mean of its divisors is an integer number (26939760).

Almost surely, 2201150152 is an apocalyptic number.

It is an amenable number.

201150152 is an abundant number, since it is smaller than the sum of its proper divisors (229886008).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

201150152 is a wasteful number, since it uses less digits than its factorization.

201150152 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 3591980 (or 3591976 counting only the distinct ones).

The product of its (nonzero) digits is 100, while the sum is 17.

The square root of 201150152 is about 14182.7413429139. The cubic root of 201150152 is about 585.9224271896.

The spelling of 201150152 in words is "two hundred one million, one hundred fifty thousand, one hundred fifty-two".

Divisors: 1 2 4 7 8 14 28 56 3591967 7183934 14367868 25143769 28735736 50287538 100575076 201150152