Search a number
-
+
150913 = 721559
BaseRepresentation
bin100100110110000001
321200000101
4210312001
514312123
63122401
71165660
oct446601
9250011
10150913
11a3424
1273401
13538c9
143cdd7
152eaad
hex24d81

150913 has 4 divisors (see below), whose sum is σ = 172480. Its totient is φ = 129348.

The previous prime is 150907. The next prime is 150919. The reversal of 150913 is 319051.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 319051 = 378623.

It is an interprime number because it is at equal distance from previous prime (150907) and next prime (150919).

It is a cyclic number.

It is not a de Polignac number, because 150913 - 25 = 150881 is a prime.

It is an Ulam number.

It is a congruent number.

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

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

2150913 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 21566.

The product of its (nonzero) digits is 135, while the sum is 19.

The square root of 150913 is about 388.4752244352. The cubic root of 150913 is about 53.2405112880.

Adding to 150913 its reverse (319051), we get a palindrome (469964).

The spelling of 150913 in words is "one hundred fifty thousand, nine hundred thirteen".

Divisors: 1 7 21559 150913