Base | Representation |
---|---|
bin | 1010000000100110101011… |
… | …11010001010111110011110 |
3 | 2212221020020112001021210021 |
4 | 11000103111322022332132 |
5 | 10341112012303033042 |
6 | 114451414145302354 |
7 | 4431146062246432 |
oct | 500232572127636 |
9 | 85836215037707 |
10 | 22011001221022 |
11 | 70168a4400020 |
12 | 2575a679349ba |
13 | c38822aac438 |
14 | 5614a3c189c2 |
15 | 282853a94867 |
hex | 1404d5e8af9e |
22011001221022 has 16 divisors (see below), whose sum is σ = 36078132240000. Its totient is φ = 9988297710040.
The previous prime is 22011001220899. The next prime is 22011001221023. The reversal of 22011001221022 is 22012210011022.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 22011001220987 and 22011001221005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22011001221023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 835128772 + ... + 835155127.
It is an arithmetic number, because the mean of its divisors is an integer number (2254883265000).
Almost surely, 222011001221022 is an apocalyptic number.
22011001221022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
22011001221022 is a deficient number, since it is larger than the sum of its proper divisors (14067131018978).
22011001221022 is a wasteful number, since it uses less digits than its factorization.
22011001221022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1670284511.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 22011001221022 its reverse (22012210011022), we get a palindrome (44023211232044).
The spelling of 22011001221022 in words is "twenty-two trillion, eleven billion, one million, two hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •