101410010001 has 6 divisors (see below), whose sum is σ = 146481125570. Its totient is φ = 67606673328.

The previous prime is 101410009991. The next prime is 101410010029. The reversal of 101410010001 is 100010014101.

It can be written as a sum of positive squares in only one way, i.e., 67184640000 + 34225370001 = 259200^2 + 185001^2 .

It is not a de Polignac number, because 101410010001 - 2¹⁷ = 101409878929 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 11267778889 = 101410010001 / (1 + 0 + 1 + 4 + 1 + 0 + 0 + 1 + 0 + 0 + 0 + 1).

It is a Duffinian number.

It is a Curzon number.

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

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 5 ways as a sum of consecutive naturals, for example, 5633889436 + ... + 5633889453.

Almost surely, 2^101410010001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 4, while the sum is 9.

Adding to 101410010001 its reverse (100010014101), we get a palindrome (201420024102).

The spelling of 101410010001 in words is "one hundred one billion, four hundred ten million, ten thousand, one".