Base | Representation |
---|---|
bin | 11101000111110000111… |
… | …000010111010110110011 |
3 | 21002022110010221001201002 |
4 | 131013300320113112303 |
5 | 230241424440201321 |
6 | 4131201124432215 |
7 | 264403425454655 |
oct | 35076070272663 |
9 | 7068403831632 |
10 | 2001201100211 |
11 | 701782939195 |
12 | 283a1a24866b |
13 | 116935352561 |
14 | 6cc041c86d5 |
15 | 370c868420b |
hex | 1d1f0e175b3 |
2001201100211 has 8 divisors (see below), whose sum is σ = 2056797560640. Its totient is φ = 1946147044608.
The previous prime is 2001201100147. The next prime is 2001201100229. The reversal of 2001201100211 is 1120011021002.
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 2001201100211 - 26 = 2001201100147 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2001201100192 and 2001201100201.
It is not an unprimeable number, because it can be changed into a prime (2001201108211) 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 7 ways as a sum of consecutive naturals, for example, 135593726 + ... + 135608483.
It is an arithmetic number, because the mean of its divisors is an integer number (257099695080).
Almost surely, 22001201100211 is an apocalyptic number.
2001201100211 is a deficient number, since it is larger than the sum of its proper divisors (55596460429).
2001201100211 is a wasteful number, since it uses less digits than its factorization.
2001201100211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271202413.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2001201100211 its reverse (1120011021002), we get a palindrome (3121212121213).
The spelling of 2001201100211 in words is "two trillion, one billion, two hundred one million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •