Base | Representation |
---|---|
bin | 11101000111101100001… |
… | …010101010011101111001 |
3 | 21002022020122002220201002 |
4 | 131013230022222131321 |
5 | 230241244213323001 |
6 | 4131145221334345 |
7 | 264401445304121 |
oct | 35075412523571 |
9 | 7068218086632 |
10 | 2001122011001 |
11 | 70174222a303 |
12 | 2839b78673b5 |
13 | 116921b508c9 |
14 | 6cbd78bbc81 |
15 | 370c176046b |
hex | 1d1ec2aa779 |
2001122011001 has 4 divisors (see below), whose sum is σ = 2025231914832. Its totient is φ = 1977012107172.
The previous prime is 2001122010989. The next prime is 2001122011003. The reversal of 2001122011001 is 1001102211002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2001122011001 - 222 = 2001117816697 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2001122011003) 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 3 ways as a sum of consecutive naturals, for example, 12054951791 + ... + 12054951956.
It is an arithmetic number, because the mean of its divisors is an integer number (506307978708).
Almost surely, 22001122011001 is an apocalyptic number.
It is an amenable number.
2001122011001 is a deficient number, since it is larger than the sum of its proper divisors (24109903831).
2001122011001 is an equidigital number, since it uses as much as digits as its factorization.
2001122011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24109903830.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2001122011001 its reverse (1001102211002), we get a palindrome (3002224222003).
The spelling of 2001122011001 in words is "two trillion, one billion, one hundred twenty-two million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •