Base | Representation |
---|---|
bin | 1010000000100110101011… |
… | …11101100100000010010101 |
3 | 2212221020020120201110101010 |
4 | 11000103111331210002111 |
5 | 10341112013020010401 |
6 | 114451414220322433 |
7 | 4431146102641464 |
oct | 500232575440225 |
9 | 85836216643333 |
10 | 22011002110101 |
11 | 70168a4957aa4 |
12 | 2575a680a3419 |
13 | c38823031014 |
14 | 5614a3daa9db |
15 | 282853bbced6 |
hex | 1404d5f64095 |
22011002110101 has 16 divisors (see below), whose sum is σ = 29576127936960. Its totient is φ = 14559969864960.
The previous prime is 22011002110099. The next prime is 22011002110103. The reversal of 22011002110101 is 10101120011022.
It is an interprime number because it is at equal distance from previous prime (22011002110099) and next prime (22011002110103).
It is not a de Polignac number, because 22011002110101 - 21 = 22011002110099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22011002110103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1032820 + ... + 6714813.
It is an arithmetic number, because the mean of its divisors is an integer number (1848507996060).
Almost surely, 222011002110101 is an apocalyptic number.
It is an amenable number.
22011002110101 is a deficient number, since it is larger than the sum of its proper divisors (7565125826859).
22011002110101 is a wasteful number, since it uses less digits than its factorization.
22011002110101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7754996.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 22011002110101 its reverse (10101120011022), we get a palindrome (32112122121123).
The spelling of 22011002110101 in words is "twenty-two trillion, eleven billion, two million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •