Base | Representation |
---|---|
bin | 1010001101001110000010… |
… | …0011111111110100111101 |
3 | 1110201211111221202111221102 |
4 | 2203103200203333310331 |
5 | 2432331102330010023 |
6 | 35511230114342445 |
7 | 2235531061021145 |
oct | 243234043776475 |
9 | 43654457674842 |
10 | 11222222110013 |
11 | 3637354900292 |
12 | 1312b3758aa25 |
13 | 6353355c1145 |
14 | 2ab230ad3925 |
15 | 146db09d2628 |
hex | a34e08ffd3d |
11222222110013 has 4 divisors (see below), whose sum is σ = 11412429264480. Its totient is φ = 11032014955548.
The previous prime is 11222222110007. The next prime is 11222222110067. The reversal of 11222222110013 is 31001122222211.
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 a cyclic number.
It is not a de Polignac number, because 11222222110013 - 28 = 11222222109757 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 (11222222110093) 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, 95103577145 + ... + 95103577262.
It is an arithmetic number, because the mean of its divisors is an integer number (2853107316120).
Almost surely, 211222222110013 is an apocalyptic number.
It is an amenable number.
11222222110013 is a deficient number, since it is larger than the sum of its proper divisors (190207154467).
11222222110013 is an equidigital number, since it uses as much as digits as its factorization.
11222222110013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190207154466.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 11222222110013 its reverse (31001122222211), we get a palindrome (42223344332224).
The spelling of 11222222110013 in words is "eleven trillion, two hundred twenty-two billion, two hundred twenty-two million, one hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •