[go: up one dir, main page]

Search a number
-
+
150947 = 271557
BaseRepresentation
bin100100110110100011
321200001122
4210312203
514312242
63122455
71166036
oct446643
9250048
10150947
11a3455
127342b
1353924
143d01d
152ead2
hex24da3

150947 has 4 divisors (see below), whose sum is σ = 151776. Its totient is φ = 150120.

The previous prime is 150929. The next prime is 150959. The reversal of 150947 is 749051.

150947 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.

It is a cyclic number.

It is not a de Polignac number, because 150947 - 26 = 150883 is a prime.

It is a Duffinian number.

It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 150947.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8 + ... + 549.

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

2150947 is an apocalyptic number.

150947 is a deficient number, since it is larger than the sum of its proper divisors (829).

150947 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 828.

The product of its (nonzero) digits is 1260, while the sum is 26.

The square root of 150947 is about 388.5189828052. The cubic root of 150947 is about 53.2445092680.

Adding to 150947 its reverse (749051), we get a palindrome (899998).

The spelling of 150947 in words is "one hundred fifty thousand, nine hundred forty-seven".

Divisors: 1 271 557 150947