Base | Representation |
---|---|
bin | 1011101101001111010… |
… | …0010100001000000001 |
3 | 201020010112220110101122 |
4 | 2323103310110020001 |
5 | 11243344240431423 |
6 | 232221054442025 |
7 | 20346665340200 |
oct | 2732364241001 |
9 | 636115813348 |
10 | 201122202113 |
11 | 78328270268 |
12 | 32b8b503315 |
13 | 15c729746b1 |
14 | 9a3d15d237 |
15 | 5371c438c8 |
hex | 2ed3d14201 |
201122202113 has 12 divisors (see below), whose sum is σ = 235528679700. Its totient is φ = 171233469792.
The previous prime is 201122202103. The next prime is 201122202217. The reversal of 201122202113 is 311202221102.
It can be written as a sum of positive squares in 2 ways, for example, as 35512271809 + 165609930304 = 188447^2 + 406952^2 .
It is not a de Polignac number, because 201122202113 - 214 = 201122185729 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201122202091 and 201122202100.
It is not an unprimeable number, because it can be changed into a prime (201122202103) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13766306 + ... + 13780907.
It is an arithmetic number, because the mean of its divisors is an integer number (19627389975).
Almost surely, 2201122202113 is an apocalyptic number.
It is an amenable number.
201122202113 is a deficient number, since it is larger than the sum of its proper divisors (34406477587).
201122202113 is a wasteful number, since it uses less digits than its factorization.
201122202113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27547376 (or 27547369 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 201122202113 its reverse (311202221102), we get a palindrome (512324423215).
The spelling of 201122202113 in words is "two hundred one billion, one hundred twenty-two million, two hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •