Search a number
-
+
10642531735 = 511269719333
BaseRepresentation
bin10011110100101100…
…00010010110010111
31000110200210121222001
421322112002112113
5133243442003420
64520014220131
7524506012213
oct117226022627
930420717861
1010642531735
114571482680
1220901b4647
131007b58074
1472d61b943
154244ccb0a
hex27a582597

10642531735 has 16 divisors (see below), whose sum is σ = 13983852960. Its totient is φ = 7711239040.

The previous prime is 10642531727. The next prime is 10642531747. The reversal of 10642531735 is 53713524601.

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

It is not a de Polignac number, because 10642531735 - 23 = 10642531727 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 10642531694 and 10642531703.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 344872 + ... + 374461.

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

Almost surely, 210642531735 is an apocalyptic number.

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

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

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

The sum of its prime factors is 719618.

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

The spelling of 10642531735 in words is "ten billion, six hundred forty-two million, five hundred thirty-one thousand, seven hundred thirty-five".

Divisors: 1 5 11 55 269 1345 2959 14795 719333 3596665 7912663 39563315 193500577 967502885 2128506347 10642531735