Base | Representation |
---|---|
bin | 1010000011100001010100… |
… | …01110101001010010100111 |
3 | 2220021210212112221211220201 |
4 | 11001300222032221102213 |
5 | 10344232214212401043 |
6 | 115005424535411331 |
7 | 4441324102664305 |
oct | 501605216512247 |
9 | 86253775854821 |
10 | 22111200122023 |
11 | 7055342038411 |
12 | 2591370223b47 |
13 | c4510087cb7c |
14 | 56628b453275 |
15 | 28526a4bcc4d |
hex | 141c2a3a94a7 |
22111200122023 has 4 divisors (see below), whose sum is σ = 22441218034360. Its totient is φ = 21781182209688.
The previous prime is 22111200121957. The next prime is 22111200122027. The reversal of 22111200122023 is 32022100211122.
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 22111200122023 - 29 = 22111200121511 is a prime.
It is a super-2 number, since 2×221112001220232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22111200122027) 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, 165008956068 + ... + 165008956201.
It is an arithmetic number, because the mean of its divisors is an integer number (5610304508590).
Almost surely, 222111200122023 is an apocalyptic number.
22111200122023 is a deficient number, since it is larger than the sum of its proper divisors (330017912337).
22111200122023 is an equidigital number, since it uses as much as digits as its factorization.
22111200122023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 330017912336.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 22111200122023 its reverse (32022100211122), we get a palindrome (54133300333145).
The spelling of 22111200122023 in words is "twenty-two trillion, one hundred eleven billion, two hundred million, one hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •