Search a number
-
+
149507 = 473181
BaseRepresentation
bin100100100000000011
321121002022
4210200003
514241012
63112055
71161611
oct444003
9247068
10149507
11a2366
127262b
1353087
143c6b1
152e472
hex24803

149507 has 4 divisors (see below), whose sum is σ = 152736. Its totient is φ = 146280.

The previous prime is 149503. The next prime is 149519. The reversal of 149507 is 705941.

149507 is nontrivially palindromic in base 7.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 705941 = 6071163.

It is a cyclic number.

It is not a de Polignac number, because 149507 - 22 = 149503 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 149507.

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

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

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

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

2149507 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3228.

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

The square root of 149507 is about 386.6613505382. The cubic root of 149507 is about 53.0746544951.

It can be divided in two parts, 149 and 507, that added together give a palindrome (656).

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

Divisors: 1 47 3181 149507