Base | Representation |
---|---|
bin | 101101101110100010011001… |
… | …010001101100010101110101 |
3 | 222101001221101001200021021220 |
4 | 231232202121101230111311 |
5 | 202324442011234020041 |
6 | 1551420414102300553 |
7 | 60234504154432635 |
oct | 5556423121542565 |
9 | 871057331607256 |
10 | 201110120220021 |
11 | 59097360a30441 |
12 | 1a6805a4427759 |
13 | 882a7ab92770c |
14 | 3793ad31c66c5 |
15 | 183b508248d66 |
hex | b6e89946c575 |
201110120220021 has 8 divisors (see below), whose sum is σ = 268146945853344. Its totient is φ = 134073354033360.
The previous prime is 201110120220007. The next prime is 201110120220049. The reversal of 201110120220021 is 120022021011102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201110120220021 - 25 = 201110120219989 is a prime.
It is a super-2 number, since 2×2011101202200212 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201110120020021) 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, 6256050 + ... + 21008531.
It is an arithmetic number, because the mean of its divisors is an integer number (33518368231668).
Almost surely, 2201110120220021 is an apocalyptic number.
It is an amenable number.
201110120220021 is a deficient number, since it is larger than the sum of its proper divisors (67036825633323).
201110120220021 is a wasteful number, since it uses less digits than its factorization.
201110120220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29723331.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 201110120220021 its reverse (120022021011102), we get a palindrome (321132141231123).
The spelling of 201110120220021 in words is "two hundred one trillion, one hundred ten billion, one hundred twenty million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •