Search a number
-
+
105011005015 = 572428616347
BaseRepresentation
bin110000111001100100…
…1001100011001010111
3101001001101201202212001
41201303021030121113
53210030304130030
6120124050140131
710405161546400
oct1416311143127
9331041652761
10105011005015
1140597a7a364
1218427b81647
139b96a22477
1451227889a7
152ae9116cca
hex187324c657

105011005015 has 12 divisors (see below), whose sum is σ = 146586791016. Its totient is φ = 72007546128.

The previous prime is 105011005007. The next prime is 105011005051. The reversal of 105011005015 is 510500110501.

It is a happy number.

It is not a de Polignac number, because 105011005015 - 23 = 105011005007 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 214307929 + ... + 214308418.

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

Almost surely, 2105011005015 is an apocalyptic number.

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

105011005015 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 125, while the sum is 19.

Adding to 105011005015 its reverse (510500110501), we get a palindrome (615511115516).

The spelling of 105011005015 in words is "one hundred five billion, eleven million, five thousand, fifteen".

Divisors: 1 5 7 35 49 245 428616347 2143081735 3000314429 15001572145 21002201003 105011005015