Base | Representation |
---|---|
bin | 1010001101001110011001… |
… | …1110000111000100010101 |
3 | 1110201211202212021100010210 |
4 | 2203103212132013010111 |
5 | 2432331303213330401 |
6 | 35511244015040033 |
7 | 2235533403360042 |
oct | 243234636070425 |
9 | 43654685240123 |
10 | 11222321230101 |
11 | 36373a5850713 |
12 | 1312b64810019 |
13 | 63534ccb7297 |
14 | 2ab23dd361c9 |
15 | 146db95614d6 |
hex | a34e6787115 |
11222321230101 has 4 divisors (see below), whose sum is σ = 14963094973472. Its totient is φ = 7481547486732.
The previous prime is 11222321230097. The next prime is 11222321230171. The reversal of 11222321230101 is 10103212322211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 11222321230101 - 22 = 11222321230097 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11222321230171) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1870386871681 + ... + 1870386871686.
It is an arithmetic number, because the mean of its divisors is an integer number (3740773743368).
Almost surely, 211222321230101 is an apocalyptic number.
It is an amenable number.
11222321230101 is a deficient number, since it is larger than the sum of its proper divisors (3740773743371).
11222321230101 is an equidigital number, since it uses as much as digits as its factorization.
11222321230101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3740773743370.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 11222321230101 its reverse (10103212322211), we get a palindrome (21325533552312).
The spelling of 11222321230101 in words is "eleven trillion, two hundred twenty-two billion, three hundred twenty-one million, two hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •