Search a number
BaseRepresentation
bin100100101001010100
321121220021
4210221110
514300400
63114524
71163416
oct445124
9247807
10150100
11a2855
1272a44
1353422
143c9b6
152e71a
hex24a54

150100 has 36 divisors (see below), whose sum is σ = 347200. Its totient is φ = 56160.

The previous prime is 150097. The next prime is 150107. The reversal of 150100 is 1051.

Adding to 150100 its reverse (1051), we get a palindrome (151151).

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (150107) by changing a digit.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1861 + ... + 1939.

2150100 is an apocalyptic number.

150100 is a gapful number since it is divisible by the number (10) 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 150100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (173600).

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

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

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

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

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

The product of its (nonzero) digits is 5, while the sum is 7.

The square root of 150100 is about 387.4274125562. The cubic root of 150100 is about 53.1447331537.

The spelling of 150100 in words is "one hundred fifty thousand, one hundred".