Base | Representation |
---|---|
bin | 1010001101001101010000… |
… | …0010111010100101100001 |
3 | 1110201210222022121110201122 |
4 | 2203103110002322211201 |
5 | 2432330140100024301 |
6 | 35511153213342025 |
7 | 2235522631040543 |
oct | 243232402724541 |
9 | 43653868543648 |
10 | 11222012111201 |
11 | 3637257309051 |
12 | 1312a99197915 |
13 | 635300c459a8 |
14 | 2ab210c6b693 |
15 | 146d9c35081b |
hex | a34d40ba961 |
11222012111201 has 32 divisors (see below), whose sum is σ = 12295655884800. Its totient is φ = 10201312800000.
The previous prime is 11222012111183. The next prime is 11222012111203. The reversal of 11222012111201 is 10211121022211.
It is not a de Polignac number, because 11222012111201 - 222 = 11222007916897 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 11222012111201.
It is not an unprimeable number, because it can be changed into a prime (11222012111203) 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, 111610451 + ... + 111710951.
It is an arithmetic number, because the mean of its divisors is an integer number (384239246400).
Almost surely, 211222012111201 is an apocalyptic number.
It is an amenable number.
11222012111201 is a deficient number, since it is larger than the sum of its proper divisors (1073643773599).
11222012111201 is a wasteful number, since it uses less digits than its factorization.
11222012111201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101801.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11222012111201 its reverse (10211121022211), we get a palindrome (21433133133412).
The spelling of 11222012111201 in words is "eleven trillion, two hundred twenty-two billion, twelve million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •