Search a number
-
+
201051000 = 23325389251
BaseRepresentation
bin10111111101111…
…00101101111000
3112000022110010100
423332330231320
5402432113000
631541115400
74660622343
oct1376745570
9460273110
10201051000
11a3540657
12573b8b60
13328647b7
141c9b745a
15129b5a00
hexbfbcb78

201051000 has 192 divisors, whose sum is σ = 689925600. Its totient is φ = 52800000.

The previous prime is 201050947. The next prime is 201051013. The reversal of 201051000 is 150102.

It is a happy number.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 800875 + ... + 801125.

Almost surely, 2201051000 is an apocalyptic number.

201051000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 201051000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (344962800).

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

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

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

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

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

The product of its (nonzero) digits is 10, while the sum is 9.

The square root of 201051000 is about 14179.2453960005. The cubic root of 201051000 is about 585.8261393700.

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