Search a number
-
+
2010011010201 = 321399159638711
BaseRepresentation
bin11101001111111101111…
…111100000010010011001
321010011012010022212020200
4131033331333200102121
5230413000304311301
64135215235412413
7265134642454515
oct35177577402231
97104163285220
102010011010201
117054938a5a37
12285678754109
1311770a60814c
146d3dc27b145
1537441d12c86
hex1d3fdfe0499

2010011010201 has 12 divisors (see below), whose sum is σ = 2905424558400. Its totient is φ = 1339049499480.

The previous prime is 2010011010199. The next prime is 2010011010221. The reversal of 2010011010201 is 1020101100102.

It is a happy number.

It is not a de Polignac number, because 2010011010201 - 21 = 2010011010199 is a prime.

It is a super-2 number, since 2×20100110102012 (a number of 25 digits) contains 22 as substring.

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 (2010011010221) 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, 79806765 + ... + 79831946.

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

Almost surely, 22010011010201 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 2010011010201 its reverse (1020101100102), we get a palindrome (3030112110303).

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

Divisors: 1 3 9 1399 4197 12591 159638711 478916133 1436748399 223334556689 670003670067 2010011010201