Search a number
-
+
10707236436 = 2231368636131
BaseRepresentation
bin10011111100011001…
…10111011001010100
31000122012112222010110
421332030313121110
5133412023031221
64530245123020
7526223002521
oct117614673124
930565488113
1010707236436
1145a4a57236
1220a99b9470
131018391580
14738062148
1542a00e776
hex27e337654

10707236436 has 24 divisors (see below), whose sum is σ = 26905363744. Its totient is φ = 3294534240.

The previous prime is 10707236411. The next prime is 10707236489. The reversal of 10707236436 is 63463270701.

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

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

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

It is a congruent number.

It is an unprimeable number.

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 7 ways as a sum of consecutive naturals, for example, 34317910 + ... + 34318221.

Almost surely, 210707236436 is an apocalyptic number.

It is an amenable number.

10707236436 is an abundant number, since it is smaller than the sum of its proper divisors (16198127308).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 127008, while the sum is 39.

The spelling of 10707236436 in words is "ten billion, seven hundred seven million, two hundred thirty-six thousand, four hundred thirty-six".

Divisors: 1 2 3 4 6 12 13 26 39 52 78 156 68636131 137272262 205908393 274544524 411816786 823633572 892269703 1784539406 2676809109 3569078812 5353618218 10707236436