Base | Representation |
---|---|
bin | 111011100110111… |
… | …0011010001110011 |
3 | 12011101112221110122 |
4 | 1313031303101303 |
5 | 13044011402421 |
6 | 530245120455 |
7 | 100364424416 |
oct | 16715632163 |
9 | 5141487418 |
10 | 2000106611 |
11 | 93700a778 |
12 | 4799b912b |
13 | 25b4b3a49 |
14 | 14d8c5b7d |
15 | ba8d42ab |
hex | 77373473 |
2000106611 has 8 divisors (see below), whose sum is σ = 2196913920. Its totient is φ = 1812453192.
The previous prime is 2000106607. The next prime is 2000106629. The reversal of 2000106611 is 1166010002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2000106611 - 22 = 2000106607 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 2000106611.
It is not an unprimeable number, because it can be changed into a prime (2000106011) 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, 2288015 + ... + 2288888.
It is an arithmetic number, because the mean of its divisors is an integer number (274614240).
Almost surely, 22000106611 is an apocalyptic number.
2000106611 is a deficient number, since it is larger than the sum of its proper divisors (196807309).
2000106611 is a wasteful number, since it uses less digits than its factorization.
2000106611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4576945.
The product of its (nonzero) digits is 72, while the sum is 17.
The square root of 2000106611 is about 44722.5514813276. The cubic root of 2000106611 is about 1259.9434364043.
Adding to 2000106611 its reverse (1166010002), we get a palindrome (3166116613).
The spelling of 2000106611 in words is "two billion, one hundred six thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •