Search a number
-
+
201002111001 = 3279282703391
BaseRepresentation
bin1011101100110010101…
…0001101000000011001
3201012211011221012100200
42323030222031000121
511243123020023001
6232201124452413
720344006516266
oct2731452150031
9635734835320
10201002111001
11782764a700a
1232b5724a109
1315c53b18173
149a2b21c26d
155366421086
hex2ecca8d019

201002111001 has 12 divisors (see below), whose sum is σ = 294011527680. Its totient is φ = 132305186520.

The previous prime is 201002110961. The next prime is 201002111003. The reversal of 201002111001 is 100111200102.

It is a happy number.

It is not a de Polignac number, because 201002111001 - 213 = 201002102809 is a prime.

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

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

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

Almost surely, 2201002111001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 201002111001 its reverse (100111200102), we get a palindrome (301113311103).

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

Divisors: 1 3 9 79 237 711 282703391 848110173 2544330519 22333567889 67000703667 201002111001