Search a number
-
+
2000101001001 = 323199145663171
BaseRepresentation
bin11101000110101111010…
…011110100011100101001
321002012121110220020021220
4131012233103310130221
5230232201324013001
64130500025452253
7264334236666435
oct35065723643451
97065543806256
102000101001001
11701268966394
12283771941089
131167bb46868c
146cb3c0619c5
1537061ccdc36
hex1d1af4f4729

2000101001001 has 16 divisors (see below), whose sum is σ = 2796732902400. Its totient is φ = 1269017537040.

The previous prime is 2000101000973. The next prime is 2000101001027. The reversal of 2000101001001 is 1001001010002.

It is not a de Polignac number, because 2000101001001 - 27 = 2000101000873 is a prime.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 72817855 + ... + 72845316.

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

Almost surely, 22000101001001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 145663396.

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

Adding to 2000101001001 its reverse (1001001010002), we get a palindrome (3001102011003).

Subtracting from 2000101001001 its reverse (1001001010002), we obtain a palindrome (999099990999).

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

Divisors: 1 3 23 69 199 597 4577 13731 145663171 436989513 3350252933 10050758799 28986971029 86960913087 666700333667 2000101001001