Search a number
-
+
2001100100103 = 3213136931249063
BaseRepresentation
bin11101000111101010110…
…111000101001000000111
321002022012002212201121100
4131013222313011020013
5230241223111200403
64131143115551143
7264401061126006
oct35075267051007
97068162781540
102001100100103
11701730924325
122839b045b4b3
1311691a44b790
146cbd4a16c3d
15370be8832a3
hex1d1eadc5207

2001100100103 has 24 divisors (see below), whose sum is σ = 3113052199712. Its totient is φ = 1231355297088.

The previous prime is 2001100100063. The next prime is 2001100100171. The reversal of 2001100100103 is 3010010011002.

It is not a de Polignac number, because 2001100100103 - 222 = 2001095905799 is a prime.

It is a super-2 number, since 2×20011001001032 (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 a congruent number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 977550 + ... + 2226612.

Almost surely, 22001100100103 is an apocalyptic number.

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

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

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

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

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

Adding to 2001100100103 its reverse (3010010011002), we get a palindrome (5011110111105).

The spelling of 2001100100103 in words is "two trillion, one billion, one hundred million, one hundred thousand, one hundred three".

Divisors: 1 3 9 13 39 117 13693 41079 123237 178009 534027 1249063 1602081 3747189 11241567 16237819 48713457 146140371 17103419659 51310258977 153930776931 222344455567 667033366701 2001100100103