Search a number
-
+
145770131 = 13109310259
BaseRepresentation
bin10001011000001…
…00011010010011
3101011021220000202
420230010122103
5244304121011
622244205415
73420011543
oct1054043223
9334256022
10145770131
1175313291
124099986b
132427a820
1415507323
15cbe623b
hex8b04693

145770131 has 8 divisors (see below), whose sum is σ = 157142160. Its totient is φ = 134420832.

The previous prime is 145770101. The next prime is 145770133. The reversal of 145770131 is 131077541.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 145770131 - 222 = 141575827 is a prime.

It is a super-2 number, since 2×1457701312 = 42497862183514322, which contains 22 as substring.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 145770094 and 145770103.

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

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

Almost surely, 2145770131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 11365.

The product of its (nonzero) digits is 2940, while the sum is 29.

The square root of 145770131 is about 12073.5301796948. The cubic root of 145770131 is about 526.2872490715.

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

Divisors: 1 13 1093 10259 14209 133367 11213087 145770131