Base | Representation |
---|---|
bin | 1001001100100010101000… |
… | …11010010011011100100111 |
3 | 2122121012211110120221202102 |
4 | 10212101110122103130213 |
5 | 10122304401241223421 |
6 | 111001525324002315 |
7 | 4155000016455122 |
oct | 446212432233447 |
9 | 78535743527672 |
10 | 20222122211111 |
11 | 6497176886937 |
12 | 232722399039b |
13 | b38c26874352 |
14 | 4dca824133b9 |
15 | 25105552960b |
hex | 126454693727 |
20222122211111 has 4 divisors (see below), whose sum is σ = 20222254301424. Its totient is φ = 20221990120800.
The previous prime is 20222122211099. The next prime is 20222122211119. The reversal of 20222122211111 is 11111222122202.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20222122211111 is a prime.
It is a super-2 number, since 2×202221222111112 (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 (20222122211119) 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, 65815250 + ... + 66121791.
It is an arithmetic number, because the mean of its divisors is an integer number (5055563575356).
Almost surely, 220222122211111 is an apocalyptic number.
20222122211111 is a deficient number, since it is larger than the sum of its proper divisors (132090313).
20222122211111 is a wasteful number, since it uses less digits than its factorization.
20222122211111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132090312.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 20222122211111 its reverse (11111222122202), we get a palindrome (31333344333313).
The spelling of 20222122211111 in words is "twenty trillion, two hundred twenty-two billion, one hundred twenty-two million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •