Base | Representation |
---|---|
bin | 11101010000111110111… |
… | …010100000101001100001 |
3 | 21010021000000212110012101 |
4 | 131100332322200221201 |
5 | 230422213124020001 |
6 | 4135515305130401 |
7 | 265203636550345 |
oct | 35207672405141 |
9 | 7107000773171 |
10 | 2011100220001 |
11 | 7059a2710424 |
12 | 285921489a01 |
13 | 11785217b6a2 |
14 | 6d4a2bab625 |
15 | 374a7766a01 |
hex | 1d43eea0a61 |
2011100220001 has 4 divisors (see below), whose sum is σ = 2053889586432. Its totient is φ = 1968310853572.
The previous prime is 2011100219987. The next prime is 2011100220007. The reversal of 2011100220001 is 1000220011102.
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 2011100220001 - 235 = 1976740481633 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2011100220001.
It is not an unprimeable number, because it can be changed into a prime (2011100220007) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21394683145 + ... + 21394683238.
It is an arithmetic number, because the mean of its divisors is an integer number (513472396608).
Almost surely, 22011100220001 is an apocalyptic number.
It is an amenable number.
2011100220001 is a deficient number, since it is larger than the sum of its proper divisors (42789366431).
2011100220001 is an equidigital number, since it uses as much as digits as its factorization.
2011100220001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42789366430.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 2011100220001 its reverse (1000220011102), we get a palindrome (3011320231103).
The spelling of 2011100220001 in words is "two trillion, eleven billion, one hundred million, two hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •