Search a number
-
+
10536321141 = 321637182223
BaseRepresentation
bin10011101000000001…
…11000000001110101
31000012021221120102100
421310000320001311
5133034244234031
64501301532313
7522046152303
oct116400700165
930167846370
1010536321141
11451752a025
122060714099
13cbbb4b768
1471d491273
15419eecde6
hex274038075

10536321141 has 12 divisors (see below), whose sum is σ = 15312501568. Its totient is φ = 6981119784.

The previous prime is 10536321127. The next prime is 10536321143. The reversal of 10536321141 is 14112363501.

It is a happy number.

10536321141 is a `hidden beast` number, since 10 + 5 + 3 + 632 + 1 + 14 + 1 = 666.

It is not a de Polignac number, because 10536321141 - 25 = 10536321109 is a prime.

It is a super-2 number, since 2×105363211412 (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

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

Almost surely, 210536321141 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 2160, while the sum is 27.

Adding to 10536321141 its reverse (14112363501), we get a palindrome (24648684642).

The spelling of 10536321141 in words is "ten billion, five hundred thirty-six million, three hundred twenty-one thousand, one hundred forty-one".

Divisors: 1 3 9 163 489 1467 7182223 21546669 64640007 1170702349 3512107047 10536321141