105001005056061 has 48 divisors (see below), whose sum is σ = 144080351251200. Its totient is φ = 67988025907200.

The previous prime is 105001005055963. The next prime is 105001005056081. The reversal of 105001005056061 is 160650500100501.

It is not a de Polignac number, because 105001005056061 - 2⁹ = 105001005055549 is a prime.

It is a super-2 number, since 2×105001005056061² (a number of 29 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 (105001005056081) by changing a digit.

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

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3243859285 + ... + 3243891653.

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

Almost surely, 2^{105001005056061} is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 105001005056061 its reverse (160650500100501), we get a palindrome (265651505156562).

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