Search a number
-
+
105036517110305 = 5113751614996123
BaseRepresentation
bin10111111000011110111000…
…010010100111001000100001
3111202220101121110211001201202
4113320132320102213020201
5102231404241340012210
61011221035415410545
731060431545211014
oct2770367022471041
9452811543731652
10105036517110305
1130516811681140
12b944945083a55
13467bb93834191
141bd1b1a37d37b
15c22392d4a9a5
hex5f87b84a7221

105036517110305 has 16 divisors (see below), whose sum is σ = 141218629395264. Its totient is φ = 74325594415680.

The previous prime is 105036517110271. The next prime is 105036517110431. The reversal of 105036517110305 is 503011715630501.

It is not a de Polignac number, because 105036517110305 - 26 = 105036517110241 is a prime.

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

It is a Duffinian number.

It is an unprimeable number.

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

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

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

Almost surely, 2105036517110305 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 51614996176.

The product of its (nonzero) digits is 47250, while the sum is 38.

The spelling of 105036517110305 in words is "one hundred five trillion, thirty-six billion, five hundred seventeen million, one hundred ten thousand, three hundred five".

Divisors: 1 5 11 37 55 185 407 2035 51614996123 258074980615 567764957353 1909754856551 2838824786765 9548774282755 21007303422061 105036517110305