Search a number
-
+
10115632131 = 3113782110091
BaseRepresentation
bin10010110101111000…
…00100110000000011
3222002222100100120220
421122330010300003
5131204100212011
64351433034123
7505450311603
oct113274046003
928088310526
1010115632131
114321013160
121b63855943
13c52945257
146bd662c03
153e30ee506
hex25af04c03

10115632131 has 32 divisors (see below), whose sum is σ = 15131218176. Its totient is φ = 5957136000.

The previous prime is 10115632127. The next prime is 10115632133. The reversal of 10115632131 is 13123651101.

It is not a de Polignac number, because 10115632131 - 22 = 10115632127 is a prime.

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

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 997396 + ... + 1007486.

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

Almost surely, 210115632131 is an apocalyptic number.

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

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

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

10115632131 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 10963.

The product of its (nonzero) digits is 540, while the sum is 24.

It can be divided in two parts, 10115 and 632131, that added together give a palindrome (642246).

The spelling of 10115632131 in words is "ten billion, one hundred fifteen million, six hundred thirty-two thousand, one hundred thirty-one".

Divisors: 1 3 11 33 37 111 407 821 1221 2463 9031 10091 27093 30273 30377 91131 111001 333003 334147 373367 1002441 1120101 4107037 8284711 12321111 24854133 91131821 273395463 306534307 919602921 3371877377 10115632131