Search a number
-
+
11020000210101 = 321566778154367
BaseRepresentation
bin1010000001011100101100…
…1100101010110010110101
31110000111112202120121202200
42200113023030222302311
52421022430023210401
635234303533255113
72215111610153631
oct240271314526265
943014482517680
1011020000210101
113569612911873
12129b8bb934499
1361c248b734bc
142a15298b3dc1
151419c7467686
hexa05cb32acb5

11020000210101 has 12 divisors (see below), whose sum is σ = 15918794291712. Its totient is φ = 7346197786536.

The previous prime is 11020000210099. The next prime is 11020000210111. The reversal of 11020000210101 is 10101200002011.

It is a happy number.

It is not a de Polignac number, because 11020000210101 - 21 = 11020000210099 is a prime.

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

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 38936181 + ... + 39218186.

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

Almost surely, 211020000210101 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 11020000210101 its reverse (10101200002011), we get a palindrome (21121200212112).

The spelling of 11020000210101 in words is "eleven trillion, twenty billion, two hundred ten thousand, one hundred one".

Divisors: 1 3 9 15667 47001 141003 78154367 234463101 703389303 1224444467789 3673333403367 11020000210101