Base | Representation |
---|---|
bin | 110000000000001101000000… |
… | …100101100011001001100001 |
3 | 1000200111220010210201012222111 |
4 | 300000031000211203021201 |
5 | 210132443132430120001 |
6 | 2025003140442035321 |
7 | 62316634251356530 |
oct | 6000150045431141 |
9 | 1020456123635874 |
10 | 211120201020001 |
11 | 612a6635646709 |
12 | 1b8186141a8b41 |
13 | 90a571b420930 |
14 | 3a1c3b50ac317 |
15 | 1961ac31aa851 |
hex | c00340963261 |
211120201020001 has 8 divisors (see below), whose sum is σ = 259840247409344. Its totient is φ = 167040159048720.
The previous prime is 211120201019911. The next prime is 211120201020019. The reversal of 211120201020001 is 100020102021112.
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 211120201020001 - 221 = 211120198922849 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is not an unprimeable number, because it can be changed into a prime (211120201020031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1160001104415 + ... + 1160001104596.
It is an arithmetic number, because the mean of its divisors is an integer number (32480030926168).
Almost surely, 2211120201020001 is an apocalyptic number.
It is an amenable number.
211120201020001 is a deficient number, since it is larger than the sum of its proper divisors (48720046389343).
211120201020001 is a wasteful number, since it uses less digits than its factorization.
211120201020001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2320002209031.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 211120201020001 its reverse (100020102021112), we get a palindrome (311140303041113).
The spelling of 211120201020001 in words is "two hundred eleven trillion, one hundred twenty billion, two hundred one million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •