Search a number
-
+
105661106051 = 1272812960773
BaseRepresentation
bin110001001100111100…
…1001000011110000011
3101002201201000022211012
41202121321020132003
53212343220343201
6120312352111135
710430244403604
oct1423171103603
9332651008735
10105661106051
11408a0a37946
12185898354ab
139c6b610437
145184c53dab
152b3622e5bb
hex1899e48783

105661106051 has 8 divisors (see below), whose sum is σ = 106872098304. Its totient is φ = 104456036160.

The previous prime is 105661106029. The next prime is 105661106107. The reversal of 105661106051 is 150601166501.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 105661106051 - 222 = 105656911747 is a prime.

It is a super-2 number, since 2×1056611060512 (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 = 105661105999 and 105661106017.

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

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

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

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

Almost surely, 2105661106051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2961181.

The product of its (nonzero) digits is 5400, while the sum is 32.

The spelling of 105661106051 in words is "one hundred five billion, six hundred sixty-one million, one hundred six thousand, fifty-one".

Divisors: 1 127 281 35687 2960773 376018171 831977213 105661106051