Search a number
BaseRepresentation
bin10010101000000110…
…11001001000010101
3221210220222020011012
421110003121020111
5130440012010401
64332145022005
7502545350642
oct112403311025
927726866135
1010000110101
11427188a803
121b31024905
13c34a28617
146ac190dc9
153d7dd08bb
hex2540d9215

10000110101 has 8 divisors (see below), whose sum is σ = 10018015800. Its totient is φ = 9982222272.

The previous prime is 10000110097. The next prime is 10000110137. The reversal of 10000110101 is 10101100001.

Adding to 10000110101 its reverse (10101100001), we get a palindrome (20101210102).

It can be divided in two parts, 100001 and 10101, that multiplied together give a palindrome (1010110101).

It can be written as a sum of positive squares in 4 ways, for example, as 138627076 + 9861483025 = 11774^2 + 99305^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 10000110101 - 22 = 10000110097 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1565951 + ... + 1572323.

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

Almost surely, 210000110101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 8935.

The product of its (nonzero) digits is 1, while the sum is 5.

The spelling of 10000110101 in words is "ten billion, one hundred ten thousand, one hundred one".