Search a number
-
+
145592670 = 2354853089
BaseRepresentation
bin10001010110110…
…01000101011110
3101010221212121010
420223121011132
5244232431140
622240320050
73415342266
oct1053310536
9333855533
10145592670
1175201a23
1240913026
1324217b12
141549c7a6
15cbad880
hex8ad915e

145592670 has 16 divisors (see below), whose sum is σ = 349422480. Its totient is φ = 38824704.

The previous prime is 145592659. The next prime is 145592677. The reversal of 145592670 is 76295541.

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

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 2145592670 is an apocalyptic number.

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

145592670 is an abundant number, since it is smaller than the sum of its proper divisors (203829810).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

145592670 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 4853099.

The product of its (nonzero) digits is 75600, while the sum is 39.

The square root of 145592670 is about 12066.1787654584. The cubic root of 145592670 is about 526.0735944485.

The spelling of 145592670 in words is "one hundred forty-five million, five hundred ninety-two thousand, six hundred seventy".

Divisors: 1 2 3 5 6 10 15 30 4853089 9706178 14559267 24265445 29118534 48530890 72796335 145592670