Base | Representation |
---|---|
bin | 1010000011100010110101… |
… | …00101000111101110011111 |
3 | 2220021212222002100222122111 |
4 | 11001301122211013232133 |
5 | 10344240344344221343 |
6 | 115010041234254451 |
7 | 4441353153030526 |
oct | 501613245075637 |
9 | 86255862328574 |
10 | 22112011320223 |
11 | 7055718a27650 |
12 | 2591557a27427 |
13 | c451cc953ac6 |
14 | 5663270954bd |
15 | 2852b6807c9d |
hex | 141c5a947b9f |
22112011320223 has 8 divisors (see below), whose sum is σ = 24211205957376. Its totient is φ = 20027651981400.
The previous prime is 22112011320109. The next prime is 22112011320239. The reversal of 22112011320223 is 32202311021122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22112011320223 - 213 = 22112011312031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22112011320194 and 22112011320203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22112011360223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3708821461 + ... + 3708827422.
It is an arithmetic number, because the mean of its divisors is an integer number (3026400744672).
Almost surely, 222112011320223 is an apocalyptic number.
22112011320223 is a deficient number, since it is larger than the sum of its proper divisors (2099194637153).
22112011320223 is a wasteful number, since it uses less digits than its factorization.
22112011320223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7417649165.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 22112011320223 its reverse (32202311021122), we get a palindrome (54314322341345).
The spelling of 22112011320223 in words is "twenty-two trillion, one hundred twelve billion, eleven million, three hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •