Search a number
-
+
149071 = 1311467
BaseRepresentation
bin100100011001001111
321120111011
4210121033
514232241
63110051
71160416
oct443117
9246434
10149071
11a1aaa
1272327
1352b10
143c47d
152e281
hex2464f

149071 has 4 divisors (see below), whose sum is σ = 160552. Its totient is φ = 137592.

The previous prime is 149069. The next prime is 149077. The reversal of 149071 is 170941.

149071 is nontrivially palindromic in base 12.

149071 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 an emirpimes, since its reverse is a distinct semiprime: 170941 = 199859.

It is not a de Polignac number, because 149071 - 21 = 149069 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (149077) 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, 5721 + ... + 5746.

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

2149071 is an apocalyptic number.

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

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

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

The sum of its prime factors is 11480.

The product of its (nonzero) digits is 252, while the sum is 22.

The square root of 149071 is about 386.0971380365. The cubic root of 149071 is about 53.0230112489.

The spelling of 149071 in words is "one hundred forty-nine thousand, seventy-one".

Divisors: 1 13 11467 149071