Search a number
-
+
105657062757 = 3311636969923
BaseRepresentation
bin110001001100110100…
…1101101010101100101
3101002201102101220110120
41202121221231111211
53212341202002012
6120312125312153
710430165133561
oct1423151552545
9332642356416
10105657062757
1140899726084
1218588405659
139c6a825c5c
1451844c06a1
152b35bd158c
hex1899a6d565

105657062757 has 16 divisors (see below), whose sum is σ = 146312644608. Its totient is φ = 67747641840.

The previous prime is 105657062743. The next prime is 105657062773. The reversal of 105657062757 is 757260756501.

It is not a de Polignac number, because 105657062757 - 27 = 105657062629 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2105657062757 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 6970120.

The product of its (nonzero) digits is 3087000, while the sum is 51.

The spelling of 105657062757 in words is "one hundred five billion, six hundred fifty-seven million, sixty-two thousand, seven hundred fifty-seven".

Divisors: 1 3 31 93 163 489 5053 15159 6969923 20909769 216067613 648202839 1136097449 3408292347 35219020919 105657062757