Base | Representation |
---|---|
bin | 11101000110101010011… |
… | …111001101011111101101 |
3 | 21002012101211200002111022 |
4 | 131012222133031133231 |
5 | 230232020121213401 |
6 | 4130444015503525 |
7 | 264332235234611 |
oct | 35065237153755 |
9 | 7065354602438 |
10 | 2000020101101 |
11 | 701227230070 |
12 | 28374a827ba5 |
13 | 1167a7781809 |
14 | 6cb31403341 |
15 | 37059b4d71b |
hex | 1d1aa7cd7ed |
2000020101101 has 4 divisors (see below), whose sum is σ = 2181840110304. Its totient is φ = 1818200091900.
The previous prime is 2000020101091. The next prime is 2000020101127. The reversal of 2000020101101 is 1011010200002.
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 a de Polignac number, because none of the positive numbers 2k-2000020101101 is a prime.
It is a super-2 number, since 2×20000201011012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000020107101) 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, 90910004585 + ... + 90910004606.
It is an arithmetic number, because the mean of its divisors is an integer number (545460027576).
Almost surely, 22000020101101 is an apocalyptic number.
It is an amenable number.
2000020101101 is a deficient number, since it is larger than the sum of its proper divisors (181820009203).
2000020101101 is a wasteful number, since it uses less digits than its factorization.
2000020101101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 181820009202.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 2000020101101 its reverse (1011010200002), we get a palindrome (3011030301103).
The spelling of 2000020101101 in words is "two trillion, twenty million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •