Search a number
-
+
145369 = 7191093
BaseRepresentation
bin100011011111011001
321101102001
4203133121
514122434
63041001
71143550
oct433731
9241361
10145369
119a244
1270161
1351223
143ad97
152d114
hex237d9

145369 has 8 divisors (see below), whose sum is σ = 175040. Its totient is φ = 117936.

The previous prime is 145361. The next prime is 145381. The reversal of 145369 is 963541.

145369 = T41 + T42 + ... + T97.

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

It is not a de Polignac number, because 145369 - 23 = 145361 is a prime.

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

It is a Duffinian number.

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

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

2145369 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 1119.

The product of its digits is 3240, while the sum is 28.

The square root of 145369 is about 381.2728681666. The cubic root of 145369 is about 52.5804058928.

Subtracting from 145369 its product of digits (3240), we obtain a square (142129 = 3772).

The spelling of 145369 in words is "one hundred forty-five thousand, three hundred sixty-nine".

Divisors: 1 7 19 133 1093 7651 20767 145369