Search a number
-
+
105661065051 = 32177724372711
BaseRepresentation
bin110001001100111100…
…0111110011101011011
3101002201200221020120200
41202121320332131123
53212343213040201
6120312351153243
710430244143223
oct1423170763533
9332650836520
10105661065051
11408a0a0a063
1218589815823
139c6b5c7889
145184c43083
152b36222386
hex1899e3e75b

105661065051 has 24 divisors (see below), whose sum is σ = 152826439584. Its totient is φ = 70346223360.

The previous prime is 105661065047. The next prime is 105661065077. The reversal of 105661065051 is 150560166501.

It is not a de Polignac number, because 105661065051 - 22 = 105661065047 is a prime.

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

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

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 38973586 + ... + 38976296.

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

Almost surely, 2105661065051 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 27000, while the sum is 36.

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

Divisors: 1 3 9 1777 2437 2711 5331 7311 8133 15993 21933 24399 4330549 4817447 6606707 12991647 14452341 19820121 38974941 43357023 59460363 11740118339 35220355017 105661065051