Base | Representation |
---|---|
bin | 101101101110100011011001… |
… | …101000101110111111010001 |
3 | 222101002001011022110212201002 |
4 | 231232203121220232333101 |
5 | 202330001214200031001 |
6 | 1551421113153551345 |
7 | 60234543005431232 |
oct | 5556433150567721 |
9 | 871061138425632 |
10 | 201111200002001 |
11 | 59097865496643 |
12 | 1a680845b75555 |
13 | 882a921549973 |
14 | 3793b96781089 |
15 | 183b56ce3946b |
hex | b6e8d9a2efd1 |
201111200002001 has 16 divisors (see below), whose sum is σ = 219340125780048. Its totient is φ = 183644270438400.
The previous prime is 201111200001997. The next prime is 201111200002007. The reversal of 201111200002001 is 100200002111102.
It can be written as a sum of positive squares in 8 ways, for example, as 13388976219025 + 187722223782976 = 3659095^2 + 13701176^2 .
It is a cyclic number.
It is not a de Polignac number, because 201111200002001 - 22 = 201111200001997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (201111200002007) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 796940990 + ... + 797193303.
It is an arithmetic number, because the mean of its divisors is an integer number (13708757861253).
Almost surely, 2201111200002001 is an apocalyptic number.
It is an amenable number.
201111200002001 is a deficient number, since it is larger than the sum of its proper divisors (18228925778047).
201111200002001 is a wasteful number, since it uses less digits than its factorization.
201111200002001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1594134532.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 201111200002001 its reverse (100200002111102), we get a palindrome (301311202113103).
The spelling of 201111200002001 in words is "two hundred one trillion, one hundred eleven billion, two hundred million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •