Search a number
-
+
10001410101 = 327115651659
BaseRepresentation
bin10010101000010000…
…10110100000110101
3221211000102021102100
421110020112200311
5130440330110401
64332232532313
7502562404014
oct112410264065
927730367370
1010001410101
114272598491
121b31551099
13c35092257
146ac40ca7b
153d808ab86
hex254216835

10001410101 has 12 divisors (see below), whose sum is σ = 14649953760. Its totient is φ = 6573696360.

The previous prime is 10001410049. The next prime is 10001410109. The reversal of 10001410101 is 10101410001.

It is not a de Polignac number, because 10001410101 - 26 = 10001410037 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a Curzon number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10001410109) 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 11 ways as a sum of consecutive naturals, for example, 7825191 + ... + 7826468.

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

Almost surely, 210001410101 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 10001410101 its reverse (10101410001), we get a palindrome (20102820102).

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

Divisors: 1 3 9 71 213 639 15651659 46954977 140864931 1111267789 3333803367 10001410101