Search a number
-
+
1350965 = 5711329
BaseRepresentation
bin101001001110100110101
32112122011202
411021310311
5321212330
644542245
714324450
oct5116465
92478152
101350965
11843000
12551985
13383bb5
14272497
151ba445
hex149d35

1350965 has 32 divisors (see below), whose sum is σ = 2108160. Its totient is φ = 813120.

The previous prime is 1350961. The next prime is 1350977. The reversal of 1350965 is 5690531.

It is not a de Polignac number, because 1350965 - 22 = 1350961 is a prime.

It is a Smith number, since the sum of its digits (29) coincides with the sum of the digits of its prime factors.

It is a Harshad number since it is a multiple of its sum of digits (29).

It is a Curzon number.

It is a nialpdrome in base 11.

It is a congruent number.

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

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

21350965 is an apocalyptic number.

It is an amenable number.

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

1350965 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 74 (or 52 counting only the distinct ones).

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

The square root of 1350965 is about 1162.3101995595. The cubic root of 1350965 is about 110.5472726900.

The spelling of 1350965 in words is "one million, three hundred fifty thousand, nine hundred sixty-five".

Divisors: 1 5 7 11 29 35 55 77 121 145 203 319 385 605 847 1015 1331 1595 2233 3509 4235 6655 9317 11165 17545 24563 38599 46585 122815 192995 270193 1350965