Search a number
-
+
20110101 = 311609397
BaseRepresentation
bin100110010110…
…1101100010101
31101211200212120
41030231230111
520122010401
61555010153
7332635014
oct114555425
941750776
1020110101
1110396020
126899959
13422158b
142956a7b
151b73836
hex132db15

20110101 has 8 divisors (see below), whose sum is σ = 29251104. Its totient is φ = 12187920.

The previous prime is 20110087. The next prime is 20110109. The reversal of 20110101 is 10101102.

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

It is not a de Polignac number, because 20110101 - 215 = 20077333 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 20110101.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (20110109) 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, 304666 + ... + 304731.

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

Almost surely, 220110101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 609411.

The product of its (nonzero) digits is 2, while the sum is 6.

The square root of 20110101 is about 4484.4287261590. The cubic root of 20110101 is about 271.9389505793.

Adding to 20110101 its reverse (10101102), we get a palindrome (30211203).

Multiplying 20110101 by its reverse (10101102), we get a palindrome (203134181431302).

The spelling of 20110101 in words is "twenty million, one hundred ten thousand, one hundred one".

Divisors: 1 3 11 33 609397 1828191 6703367 20110101