Base | Representation |
---|---|
bin | 1010001101001101101100… |
… | …1000100001110101110111 |
3 | 1110201211021121100211100121 |
4 | 2203103123020201311313 |
5 | 2432330411020220343 |
6 | 35511213102152411 |
7 | 2235525603551041 |
oct | 243233310416567 |
9 | 43654247324317 |
10 | 11222131023223 |
11 | 363730844744a |
12 | 1312b10b82707 |
13 | 63531c77b633 |
14 | 2ab222982a91 |
15 | 146da79ddaed |
hex | a34db221d77 |
11222131023223 has 4 divisors (see below), whose sum is σ = 11327010752520. Its totient is φ = 11117251293928.
The previous prime is 11222131023167. The next prime is 11222131023247. The reversal of 11222131023223 is 32232013122211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11222131023223 - 229 = 11221594152311 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 (11222131020223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52439864488 + ... + 52439864701.
It is an arithmetic number, because the mean of its divisors is an integer number (2831752688130).
Almost surely, 211222131023223 is an apocalyptic number.
11222131023223 is a deficient number, since it is larger than the sum of its proper divisors (104879729297).
11222131023223 is a wasteful number, since it uses less digits than its factorization.
11222131023223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104879729296.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 11222131023223 its reverse (32232013122211), we get a palindrome (43454144145434).
The spelling of 11222131023223 in words is "eleven trillion, two hundred twenty-two billion, one hundred thirty-one million, twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •