[go: up one dir, main page]

Search a number
-
+
1550131 = 11223557
BaseRepresentation
bin101111010011100110011
32220202101021
411322130303
5344101011
653120311
716114222
oct5723463
92822337
101550131
11969700
12629097
1342374b
142c4cb9
15209471
hex17a733

1550131 has 12 divisors (see below), whose sum is σ = 1781136. Its totient is φ = 1345520.

The previous prime is 1550119. The next prime is 1550141. The reversal of 1550131 is 1310551.

It is not a de Polignac number, because 1550131 - 25 = 1550099 is a prime.

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

It is a Duffinian number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2505 + ... + 3061.

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

21550131 is an apocalyptic number.

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

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

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

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

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

The product of its (nonzero) digits is 75, while the sum is 16.

The square root of 1550131 is about 1245.0425695533. The cubic root of 1550131 is about 115.7327129696.

Adding to 1550131 its reverse (1310551), we get a palindrome (2860682).

It can be divided in two parts, 1550 and 131, that added together give a square (1681 = 412).

The spelling of 1550131 in words is "one million, five hundred fifty thousand, one hundred thirty-one".

Divisors: 1 11 23 121 253 557 2783 6127 12811 67397 140921 1550131