[go: up one dir, main page]

Search a number
-
+
1100020101 = 33747210853
BaseRepresentation
bin100000110010000…
…1111100110000101
32211122212210220020
41001210033212011
54223101120401
6301053125353
736155005455
oct10144174605
92748783806
101100020101
11514a29424
12268489859
13146b89b8b
14a6145d65
156688bd36
hex4190f985

1100020101 has 16 divisors (see below), whose sum is σ = 1538390784. Its totient is φ = 698341824.

The previous prime is 1100020099. The next prime is 1100020127. The reversal of 1100020101 is 1010200011.

It is not a de Polignac number, because 1100020101 - 21 = 1100020099 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21100020101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 210940.

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

The square root of 1100020101 is about 33166.5509361465. The cubic root of 1100020101 is about 1032.2864032552.

Adding to 1100020101 its reverse (1010200011), we get a palindrome (2110220112).

The spelling of 1100020101 in words is "one billion, one hundred million, twenty thousand, one hundred one".

Divisors: 1 3 37 47 111 141 1739 5217 210853 632559 7801561 9910091 23404683 29730273 366673367 1100020101