Search a number
-
+
145707 = 3172857
BaseRepresentation
bin100011100100101011
321101212120
4203210223
514130312
63042323
71144542
oct434453
9241776
10145707
119a521
12703a3
1351423
143b159
152d28c
hex2392b

145707 has 8 divisors (see below), whose sum is σ = 205776. Its totient is φ = 91392.

The previous prime is 145703. The next prime is 145709. The reversal of 145707 is 707541.

145707 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is not a de Polignac number, because 145707 - 22 = 145703 is a prime.

145707 is a lucky number.

It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 145707.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1378 + ... + 1479.

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

2145707 is an apocalyptic number.

145707 is a gapful number since it is divisible by the number (17) formed by its first and last digit.

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

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

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

The sum of its prime factors is 2877.

The product of its (nonzero) digits is 980, while the sum is 24.

The square root of 145707 is about 381.7158629138. The cubic root of 145707 is about 52.6211262225.

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

Divisors: 1 3 17 51 2857 8571 48569 145707