Base | Representation |
---|---|
bin | 11101001000100111001… |
… | …000000111111101001101 |
3 | 21002101210120102222102110 |
4 | 131020213020013331031 |
5 | 230300310431413401 |
6 | 4131431315214233 |
7 | 264435116263224 |
oct | 35104710077515 |
9 | 7071716388373 |
10 | 2002111201101 |
11 | 7020aa63a490 |
12 | 284032ba7379 |
13 | 116a4ba746ab |
14 | 6cc8d013cbb |
15 | 3712d5089d6 |
hex | 1d227207f4d |
2002111201101 has 64 divisors (see below), whose sum is σ = 3042777323520. Its totient is φ = 1160406051840.
The previous prime is 2002111201087. The next prime is 2002111201133. The reversal of 2002111201101 is 1011021112002.
It is not a de Polignac number, because 2002111201101 - 29 = 2002111200589 is a prime.
It is a super-2 number, since 2×20021112011012 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002111201141) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 14120880 + ... + 14261958.
It is an arithmetic number, because the mean of its divisors is an integer number (47543395680).
Almost surely, 22002111201101 is an apocalyptic number.
It is an amenable number.
2002111201101 is a deficient number, since it is larger than the sum of its proper divisors (1040666122419).
2002111201101 is a wasteful number, since it uses less digits than its factorization.
2002111201101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141346.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 2002111201101 its reverse (1011021112002), we get a palindrome (3013132313103).
The spelling of 2002111201101 in words is "two trillion, two billion, one hundred eleven million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •