Search a number
-
+
134625671 = 5315671621
BaseRepresentation
bin10000000011000…
…11100110000111
3100101022200200222
420001203212013
5233431010141
621205254555
73223204445
oct1001434607
9311280628
10134625671
1169aa1294
123910445b
1321b7807b
1413c45b95
15bc4414b
hex8063987

134625671 has 8 divisors (see below), whose sum is σ = 137337984. Its totient is φ = 131919840.

The previous prime is 134625661. The next prime is 134625677. The reversal of 134625671 is 176526431.

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

It is a cyclic number.

It is not a de Polignac number, because 134625671 - 214 = 134609287 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 (134625677) 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, 82241 + ... + 83861.

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

Almost surely, 2134625671 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3241.

The product of its digits is 30240, while the sum is 35.

The square root of 134625671 is about 11602.8303012670. The cubic root of 134625671 is about 512.5182016934.

Subtracting from 134625671 its product of digits (30240), we obtain a palindrome (134595431).

The spelling of 134625671 in words is "one hundred thirty-four million, six hundred twenty-five thousand, six hundred seventy-one".

Divisors: 1 53 1567 1621 83051 85913 2540107 134625671