Base | Representation |
---|---|
bin | 11101001000101100011… |
… | …011001111110010101011 |
3 | 21002102000202201111210200 |
4 | 131020230123033302223 |
5 | 230301001211200021 |
6 | 4131444212443243 |
7 | 264440246021556 |
oct | 35105433176253 |
9 | 7072022644720 |
10 | 2002200100011 |
11 | 702145839561 |
12 | 284058919523 |
13 | 116a642cc3b7 |
14 | 6cc9ab5569d |
15 | 37136219126 |
hex | 1d22c6cfcab |
2002200100011 has 24 divisors (see below), whose sum is σ = 2991979361280. Its totient is φ = 1288692308736.
The previous prime is 2002200099983. The next prime is 2002200100091. The reversal of 2002200100011 is 1100010022002.
It is not a de Polignac number, because 2002200100011 - 25 = 2002200099979 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 2002200099966 and 2002200100002.
It is not an unprimeable number, because it can be changed into a prime (2002200100091) 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 23 ways as a sum of consecutive naturals, for example, 4117206 + ... + 4577748.
It is an arithmetic number, because the mean of its divisors is an integer number (124665806720).
Almost surely, 22002200100011 is an apocalyptic number.
2002200100011 is a deficient number, since it is larger than the sum of its proper divisors (989779261269).
2002200100011 is a wasteful number, since it uses less digits than its factorization.
2002200100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 477235 (or 477232 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 2002200100011 its reverse (1100010022002), we get a palindrome (3102210122013).
The spelling of 2002200100011 in words is "two trillion, two billion, two hundred million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •