Search a number
-
+
2002201101 = 321271751707
BaseRepresentation
bin111011101010111…
…0010101000001101
312011112111100120100
41313111302220031
513100030413401
6530402041313
7100421266665
oct16725625015
95145440510
102002201101
1193821035a
1247a649239
1325ba681a4
1414dcad1a5
15bab99b86
hex77572a0d

2002201101 has 12 divisors (see below), whose sum is σ = 2914842112. Its totient is φ = 1324289736.

The previous prime is 2002201079. The next prime is 2002201127. The reversal of 2002201101 is 1011022002.

It is not a de Polignac number, because 2002201101 - 27 = 2002200973 is a prime.

It is a super-2 number, since 2×20022011012 = 8017618497691224402, which contains 22 as substring.

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

It is a Duffinian number.

It is a congruent number.

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

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

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

Almost surely, 22002201101 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

The square root of 2002201101 is about 44745.9618401482. The cubic root of 2002201101 is about 1260.3830826866.

Adding to 2002201101 its reverse (1011022002), we get a palindrome (3013223103).

The spelling of 2002201101 in words is "two billion, two million, two hundred one thousand, one hundred one".

Divisors: 1 3 9 127 381 1143 1751707 5255121 15765363 222466789 667400367 2002201101