Base | Representation |
---|---|
bin | 11101011011001111001… |
… | …110001001100011111101 |
3 | 21011022102102000022100201 |
4 | 131123033032021203331 |
5 | 231112240433101023 |
6 | 4144540045123501 |
7 | 266043541535131 |
oct | 35331716114375 |
9 | 7138372008321 |
10 | 2022111222013 |
11 | 70a633083193 |
12 | 287a94b59591 |
13 | 1188b84589ac |
14 | 6dc293033c1 |
15 | 378ee27abad |
hex | 1d6cf3898fd |
2022111222013 has 4 divisors (see below), whose sum is σ = 2076762876700. Its totient is φ = 1967459567328.
The previous prime is 2022111222007. The next prime is 2022111222041. The reversal of 2022111222013 is 3102221112202.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1609744325049 + 412366896964 = 1268757^2 + 642158^2 .
It is a cyclic number.
It is not a de Polignac number, because 2022111222013 - 217 = 2022111090941 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 (2022111222073) 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, 27325827288 + ... + 27325827361.
It is an arithmetic number, because the mean of its divisors is an integer number (519190719175).
Almost surely, 22022111222013 is an apocalyptic number.
It is an amenable number.
2022111222013 is a deficient number, since it is larger than the sum of its proper divisors (54651654687).
2022111222013 is an equidigital number, since it uses as much as digits as its factorization.
2022111222013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54651654686.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 2022111222013 its reverse (3102221112202), we get a palindrome (5124332334215).
The spelling of 2022111222013 in words is "two trillion, twenty-two billion, one hundred eleven million, two hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •