Base | Representation |
---|---|
bin | 1010001100100100010001… |
… | …1001101010010011011001 |
3 | 1110200202120201101002220022 |
4 | 2203021010121222103121 |
5 | 2432140123112020441 |
6 | 35502133511440225 |
7 | 2234653222360340 |
oct | 243110431522331 |
9 | 43622521332808 |
10 | 11211012220121 |
11 | 363262214507a |
12 | 1310929386075 |
13 | 63426a058abc |
14 | 2aa889dc8b57 |
15 | 1469567d384b |
hex | a324466a4d9 |
11211012220121 has 32 divisors (see below), whose sum is σ = 13029105712896. Its totient is φ = 9448242048000.
The previous prime is 11211012220069. The next prime is 11211012220123. The reversal of 11211012220121 is 12102221011211.
It is not a de Polignac number, because 11211012220121 - 234 = 11193832350937 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11211012220121.
It is not an unprimeable number, because it can be changed into a prime (11211012220123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 133995461 + ... + 134079101.
It is an arithmetic number, because the mean of its divisors is an integer number (407159553528).
Almost surely, 211211012220121 is an apocalyptic number.
It is an amenable number.
11211012220121 is a deficient number, since it is larger than the sum of its proper divisors (1818093492775).
11211012220121 is an equidigital number, since it uses as much as digits as its factorization.
11211012220121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84833.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11211012220121 its reverse (12102221011211), we get a palindrome (23313233231332).
The spelling of 11211012220121 in words is "eleven trillion, two hundred eleven billion, twelve million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •