Search a number
-
+
105061501165 = 5232931502699
BaseRepresentation
bin110000111011000100…
…1110100100011101101
3101001011220202020112211
41201312021310203231
53210131221014130
6120133052330421
710406344011445
oct1416611644355
9331156666484
10105061501165
1140613529915
1218440a73a11
139ba432264a
145129371125
152aed78da2a
hex18762748ed

105061501165 has 16 divisors (see below), whose sum is σ = 136091664000. Its totient is φ = 77622647872.

The previous prime is 105061501157. The next prime is 105061501189. The reversal of 105061501165 is 561105160501.

It is a cyclic number.

It is not a de Polignac number, because 105061501165 - 23 = 105061501157 is a prime.

It is a super-2 number, since 2×1050615011652 (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 (19) of ones.

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

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

Almost surely, 2105061501165 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 31502756.

The product of its (nonzero) digits is 4500, while the sum is 31.

Adding to 105061501165 its reverse (561105160501), we get a palindrome (666166661666).

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

Divisors: 1 5 23 29 115 145 667 3335 31502699 157513495 724562077 913578271 3622810385 4567891355 21012300233 105061501165