Search a number
-
+
105001060101 = 3731161291951
BaseRepresentation
bin110000111001010001…
…1010000011100000101
3101001000201000111222220
41201302203100130011
53210020232410401
6120123053042553
710405011166440
oct1416243203405
9331021014886
10105001060101
11405923a7623
1218424786459
139b9494c9c2
14512131a657
152ae8300336
hex18728d0705

105001060101 has 16 divisors (see below), whose sum is σ = 165162958848. Its totient is φ = 58065102000.

The previous prime is 105001060057. The next prime is 105001060111. The reversal of 105001060101 is 101060100501.

It is not a de Polignac number, because 105001060101 - 27 = 105001059973 is a prime.

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

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 2105001060101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 161291992.

The product of its (nonzero) digits is 30, while the sum is 15.

Adding to 105001060101 its reverse (101060100501), we get a palindrome (206061160602).

It can be divided in two parts, 1050010 and 60101, that added together give a palindrome (1110111).

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

Divisors: 1 3 7 21 31 93 217 651 161291951 483875853 1129043657 3387130971 5000050481 15000151443 35000353367 105001060101