Search a number
-
+
105311405110 = 2580913017479
BaseRepresentation
bin110001000010100001…
…1001000010000110110
3101001211022222200022111
41202011003020100312
53211134204430420
6120213540521234
710415500113412
oct1420503102066
9331738880274
10105311405110
11407315a73aa
12184b06b021a
139c140303c2
145150623d42
152b156a445a
hex18850c8436

105311405110 has 16 divisors (see below), whose sum is σ = 189794858400. Its totient is φ = 42072488896.

The previous prime is 105311405093. The next prime is 105311405123. The reversal of 105311405110 is 11504113501.

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

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6500650 + ... + 6516829.

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

Almost surely, 2105311405110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 13018295.

The product of its (nonzero) digits is 300, while the sum is 22.

Adding to 105311405110 its reverse (11504113501), we get a palindrome (116815518611).

The spelling of 105311405110 in words is "one hundred five billion, three hundred eleven million, four hundred five thousand, one hundred ten".

Divisors: 1 2 5 10 809 1618 4045 8090 13017479 26034958 65087395 130174790 10531140511 21062281022 52655702555 105311405110