Base | Representation |
---|---|
bin | 1010000110101100000001… |
… | …00001100011010000010011 |
3 | 2220200012202112201011020221 |
4 | 11003112000201203100103 |
5 | 10403023101124213021 |
6 | 115131423124213511 |
7 | 4452225601360210 |
oct | 503260041432023 |
9 | 86605675634227 |
10 | 22220022101011 |
11 | 7097505223939 |
12 | 25aa48053a297 |
13 | c52453cac707 |
14 | 56b651dc8b07 |
15 | 287ed8e6c241 |
hex | 143580863413 |
22220022101011 has 8 divisors (see below), whose sum is σ = 25394348447744. Its totient is φ = 19045705123080.
The previous prime is 22220022101009. The next prime is 22220022101077. The reversal of 22220022101011 is 11010122002222.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22220022101011 - 21 = 22220022101009 is a prime.
It is a super-3 number, since 3×222200221010113 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22220022131011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3821326 + ... + 7683916.
It is an arithmetic number, because the mean of its divisors is an integer number (3174293555968).
Almost surely, 222220022101011 is an apocalyptic number.
22220022101011 is a deficient number, since it is larger than the sum of its proper divisors (3174326346733).
22220022101011 is an equidigital number, since it uses as much as digits as its factorization.
22220022101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4684401.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 22220022101011 its reverse (11010122002222), we get a palindrome (33230144103233).
The spelling of 22220022101011 in words is "twenty-two trillion, two hundred twenty billion, twenty-two million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •