Base | Representation |
---|---|
bin | 1010000001011101011110… |
… | …1101011010011000011101 |
3 | 1110000112002101120011022120 |
4 | 2200113113231122120131 |
5 | 2421023342242321341 |
6 | 35234340432333153 |
7 | 2215120036314531 |
oct | 240272755323035 |
9 | 43015071504276 |
10 | 11020210120221 |
11 | 3569710353405 |
12 | 129b95a0a41b9 |
13 | 61c2804ba483 |
14 | 2a1549715bc1 |
15 | 1419daacd066 |
hex | a05d7b5a61d |
11020210120221 has 32 divisors (see below), whose sum is σ = 15748946357760. Its totient is φ = 6833916340416.
The previous prime is 11020210120201. The next prime is 11020210120247. The reversal of 11020210120221 is 12202101202011.
It is not a de Polignac number, because 11020210120221 - 210 = 11020210119197 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11020210120221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11020210120201) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 3527286 + ... + 5872151.
It is an arithmetic number, because the mean of its divisors is an integer number (492154573680).
Almost surely, 211020210120221 is an apocalyptic number.
It is an amenable number.
11020210120221 is a deficient number, since it is larger than the sum of its proper divisors (4728736237539).
11020210120221 is a wasteful number, since it uses less digits than its factorization.
11020210120221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9399833.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11020210120221 its reverse (12202101202011), we get a palindrome (23222311322232).
The spelling of 11020210120221 in words is "eleven trillion, twenty billion, two hundred ten million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •