Base | Representation |
---|---|
bin | 1010000001100100001110… |
… | …1001110011000110010011 |
3 | 1110000200202121021002021222 |
4 | 2200121003221303012103 |
5 | 2421041044401042321 |
6 | 35235240244235255 |
7 | 2215212646432544 |
oct | 240310351630623 |
9 | 43020677232258 |
10 | 11022021112211 |
11 | 356a45a6354aa |
12 | 12a018469bb2b |
13 | 61c4ab758775 |
14 | 2a167c0504cb |
15 | 141a94aa83ab |
hex | a0643a73193 |
11022021112211 has 16 divisors (see below), whose sum is σ = 11304742647264. Its totient is φ = 10740506563584.
The previous prime is 11022021112189. The next prime is 11022021112217. The reversal of 11022021112211 is 11221112022011.
It is a cyclic number.
It is not a de Polignac number, because 11022021112211 - 222 = 11022016917907 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11022021112211.
It is not an unprimeable number, because it can be changed into a prime (11022021112217) 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 15 ways as a sum of consecutive naturals, for example, 141310655 + ... + 141388631.
It is an arithmetic number, because the mean of its divisors is an integer number (706546415454).
Almost surely, 211022021112211 is an apocalyptic number.
11022021112211 is a deficient number, since it is larger than the sum of its proper divisors (282721535053).
11022021112211 is an equidigital number, since it uses as much as digits as its factorization.
11022021112211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85670.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11022021112211 its reverse (11221112022011), we get a palindrome (22243133134222).
The spelling of 11022021112211 in words is "eleven trillion, twenty-two billion, twenty-one million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •