Search a number
-
+
10511005215 = 351015169031
BaseRepresentation
bin10011100101000000…
…10011011000011111
31000010112022101111110
421302200103120133
5133011304131330
64454555153103
7521321033034
oct116240233037
930115271443
1010511005215
114504208877
122054145793
13cb6826819
14719d8138b
15417b9bdb0
hex27281361f

10511005215 has 16 divisors (see below), whose sum is σ = 16819508736. Its totient is φ = 5605236000.

The previous prime is 10511005207. The next prime is 10511005249. The reversal of 10511005215 is 51250011501.

It is not a de Polignac number, because 10511005215 - 23 = 10511005207 is a prime.

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

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 210511005215 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 79190.

The product of its (nonzero) digits is 250, while the sum is 21.

Adding to 10511005215 its reverse (51250011501), we get a palindrome (61761016716).

The spelling of 10511005215 in words is "ten billion, five hundred eleven million, five thousand, two hundred fifteen".

Divisors: 1 3 5 15 10151 30453 50755 69031 152265 207093 345155 1035465 700733681 2102201043 3503668405 10511005215