Search a number
-
+
105011105061 = 3337347299333
BaseRepresentation
bin110000111001100100…
…1100100110100100101
3101001001101220212002110
41201303021210310211
53210030320330221
6120124052231233
710405162444152
oct1416311446445
9331041825073
10105011105061
1140598038545
121842800b519
139b96a58b75
1451227b3229
152ae9136776
hex1873264d25

105011105061 has 16 divisors (see below), whose sum is σ = 140835449664. Its totient is φ = 69598281984.

The previous prime is 105011105051. The next prime is 105011105131. The reversal of 105011105061 is 160501110501.

It is a happy number.

It is not a de Polignac number, because 105011105061 - 230 = 103937363237 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (105011105041) 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 15 ways as a sum of consecutive naturals, for example, 201151 + ... + 500483.

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

Almost surely, 2105011105061 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 300020.

The product of its (nonzero) digits is 150, while the sum is 21.

Adding to 105011105061 its reverse (160501110501), we get a palindrome (265512215562).

The spelling of 105011105061 in words is "one hundred five billion, eleven million, one hundred five thousand, sixty-one".

Divisors: 1 3 337 347 1011 1041 116939 299333 350817 897999 100875221 103868551 302625663 311605653 35003701687 105011105061