Search a number
-
+
145770161 = 831756267
BaseRepresentation
bin10001011000001…
…00011010110001
3101011021220001212
420230010122301
5244304121121
622244205505
73420011615
oct1054043261
9334256055
10145770161
1175313309
1240999895
132427a844
1415507345
15cbe625b
hex8b046b1

145770161 has 4 divisors (see below), whose sum is σ = 147526512. Its totient is φ = 144013812.

The previous prime is 145770151. The next prime is 145770197. The reversal of 145770161 is 161077541.

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: 161077541 = 494332587.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-145770161 is a prime.

It is a Duffinian number.

It is a Curzon number.

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

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

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

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

Almost surely, 2145770161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1756350.

The product of its (nonzero) digits is 5880, while the sum is 32.

The square root of 145770161 is about 12073.5314220819. The cubic root of 145770161 is about 526.2872851754.

The spelling of 145770161 in words is "one hundred forty-five million, seven hundred seventy thousand, one hundred sixty-one".

Divisors: 1 83 1756267 145770161