Search a number
-
+
2000010110001 = 31331175008151
BaseRepresentation
bin11101000110101001111…
…001000110010000110001
321002012101010212111021120
4131012221321012100301
5230232010042010001
64130443021412453
7264332054303211
oct35065171062061
97065333774246
102000010110001
11701221626662
1228374740a129
131167a5694017
146cb2dd62241
1537058d28236
hex1d1a9e46431

2000010110001 has 8 divisors (see below), whose sum is σ = 2666700711744. Its totient is φ = 1333329790800.

The previous prime is 2000010109973. The next prime is 2000010110011. The reversal of 2000010110001 is 1000110100002.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 2000010110001 - 27 = 2000010109873 is a prime.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2104725 + ... + 2903426.

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

Almost surely, 22000010110001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5141271.

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

Adding to 2000010110001 its reverse (1000110100002), we get a palindrome (3000120210003).

Subtracting from 2000010110001 its reverse (1000110100002), we obtain a palindrome (999900009999).

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

Divisors: 1 3 133117 399351 5008151 15024453 666670036667 2000010110001