Base | Representation |
---|---|
bin | 1001001001010010001101… |
… | …00101110101001100011001 |
3 | 2122012111222220002201101221 |
4 | 10210221012211311030121 |
5 | 10113441213111432301 |
6 | 110434301425012041 |
7 | 4143626012543464 |
oct | 444510645651431 |
9 | 78174886081357 |
10 | 20110221202201 |
11 | 6453773661689 |
12 | 23095b4484021 |
13 | b2b50257c600 |
14 | 4d74a89822db |
15 | 24d1a65c4da1 |
hex | 124a46975319 |
20110221202201 has 12 divisors (see below), whose sum is σ = 21795652107372. Its totient is φ = 18546662062656.
The previous prime is 20110221202189. The next prime is 20110221202217. The reversal of 20110221202201 is 10220212201102.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 5434847788176 + 14675373414025 = 2331276^2 + 3830845^2 .
It is not a de Polignac number, because 20110221202201 - 27 = 20110221202073 is a prime.
It is not an unprimeable number, because it can be changed into a prime (20110221202301) 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, 53076846 + ... + 53454391.
It is an arithmetic number, because the mean of its divisors is an integer number (1816304342281).
Almost surely, 220110221202201 is an apocalyptic number.
It is an amenable number.
20110221202201 is a deficient number, since it is larger than the sum of its proper divisors (1685430905171).
20110221202201 is a wasteful number, since it uses less digits than its factorization.
20110221202201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106532380 (or 106532367 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 20110221202201 its reverse (10220212201102), we get a palindrome (30330433403303).
The spelling of 20110221202201 in words is "twenty trillion, one hundred ten billion, two hundred twenty-one million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •