Search a number
-
+
136410631511 = 7211223007359
BaseRepresentation
bin111111100001010110…
…1010000110101010111
3111001002200200001211112
41333002231100311113
54213332110202021
6142355521125235
712566245144100
oct1770255206527
9431080601745
10136410631511
1152940277500
122252b78981b
13cb2c06500b
146860a493a7
153835a5ed5b
hex1fc2b50d57

136410631511 has 18 divisors (see below), whose sum is σ = 174418796160. Its totient is φ = 106293993960.

The previous prime is 136410631477. The next prime is 136410631517. The reversal of 136410631511 is 115136014631.

It is not a de Polignac number, because 136410631511 - 210 = 136410630487 is a prime.

It is a super-2 number, since 2×1364106315112 (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 (136410631517) by changing a digit.

It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 11497751 + ... + 11509608.

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

Almost surely, 2136410631511 is an apocalyptic number.

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

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

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

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

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

The product of its (nonzero) digits is 6480, while the sum is 32.

The spelling of 136410631511 in words is "one hundred thirty-six billion, four hundred ten million, six hundred thirty-one thousand, five hundred eleven".

Divisors: 1 7 11 49 77 121 539 847 5929 23007359 161051513 253080949 1127360591 1771566643 2783890439 12400966501 19487233073 136410631511