Base | Representation |
---|---|
bin | 101101101110100010010010… |
… | …110101101000110011011001 |
3 | 222101001221002112102101200220 |
4 | 231232202102311220303121 |
5 | 202324441301110432301 |
6 | 1551420355243150253 |
7 | 60234501403335114 |
oct | 5556422265506331 |
9 | 871057075371626 |
10 | 201110012202201 |
11 | 59097305a63013 |
12 | 1a680574215389 |
13 | 882a79243764b |
14 | 3793ac2b0957b |
15 | 183b4eda0d936 |
hex | b6e892d68cd9 |
201110012202201 has 8 divisors (see below), whose sum is σ = 273206054312640. Its totient is φ = 131543655779952.
The previous prime is 201110012202199. The next prime is 201110012202233. The reversal of 201110012202201 is 102202210011102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201110012202201 - 21 = 201110012202199 is a prime.
It is a super-2 number, since 2×2011100122022012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (201110012202271) 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, 632421421861 + ... + 632421422178.
It is an arithmetic number, because the mean of its divisors is an integer number (34150756789080).
Almost surely, 2201110012202201 is an apocalyptic number.
It is an amenable number.
201110012202201 is a deficient number, since it is larger than the sum of its proper divisors (72096042110439).
201110012202201 is a wasteful number, since it uses less digits than its factorization.
201110012202201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1264842844095.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 201110012202201 its reverse (102202210011102), we get a palindrome (303312222213303).
The spelling of 201110012202201 in words is "two hundred one trillion, one hundred ten billion, twelve million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •