Search a number
-
+
10112200215 = 351351857437
BaseRepresentation
bin10010110101011101…
…11110111000010111
3222002201212222212220
421122232332320113
5131202210401330
64351231313423
7505406166165
oct113256767027
928081788786
1010112200215
11431a089767
121b6267b873
13c52013130
146bd00c235
153e2b72710
hex25abbee17

10112200215 has 16 divisors (see below), whose sum is σ = 17424099168. Its totient is φ = 4978313856.

The previous prime is 10112200213. The next prime is 10112200223. The reversal of 10112200215 is 51200221101.

It is not a de Polignac number, because 10112200215 - 21 = 10112200213 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 210112200215 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 51857458.

The product of its (nonzero) digits is 40, while the sum is 15.

Adding to 10112200215 its reverse (51200221101), we get a palindrome (61312421316).

The spelling of 10112200215 in words is "ten billion, one hundred twelve million, two hundred thousand, two hundred fifteen".

Divisors: 1 3 5 13 15 39 65 195 51857437 155572311 259287185 674146681 777861555 2022440043 3370733405 10112200215