Base | Representation |
---|---|
bin | 1001001001010010001101… |
… | …00101011100011111011110 |
3 | 2122012111222212220120121120 |
4 | 10210221012211130133132 |
5 | 10113441213100213042 |
6 | 110434301422511410 |
7 | 4143626011642503 |
oct | 444510645343736 |
9 | 78174885816546 |
10 | 20110221101022 |
11 | 64537735a2668 |
12 | 23095b4435566 |
13 | b2b502545540 |
14 | 4d74a89574aa |
15 | 24d1a65a4dec |
hex | 124a4695c7de |
20110221101022 has 32 divisors (see below), whose sum is σ = 43319313384480. Its totient is φ = 6187047336960.
The previous prime is 20110221100969. The next prime is 20110221101039. The reversal of 20110221101022 is 22010112201102.
It is a junction number, because it is equal to n+sod(n) for n = 20110221100992 and 20110221101010.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14172747 + ... + 15526982.
It is an arithmetic number, because the mean of its divisors is an integer number (1353728543265).
Almost surely, 220110221101022 is an apocalyptic number.
20110221101022 is an abundant number, since it is smaller than the sum of its proper divisors (23209092283458).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20110221101022 is a wasteful number, since it uses less digits than its factorization.
20110221101022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29708428.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 20110221101022 its reverse (22010112201102), we get a palindrome (42120333302124).
The spelling of 20110221101022 in words is "twenty trillion, one hundred ten billion, two hundred twenty-one million, one hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •