Base | Representation |
---|---|
bin | 1010000110101011111111… |
… | …10111100101011111000101 |
3 | 2220200012201210000020211211 |
4 | 11003111333313211133011 |
5 | 10403023040320200401 |
6 | 115131422052331421 |
7 | 4452225406021453 |
oct | 503257767453705 |
9 | 86605653006754 |
10 | 22220011100101 |
11 | 70974a9a9a781 |
12 | 25aa478913b71 |
13 | c5245192a3b9 |
14 | 56b6507639d3 |
15 | 287ed7ee7951 |
hex | 14357fde57c5 |
22220011100101 has 2 divisors, whose sum is σ = 22220011100102. Its totient is φ = 22220011100100.
The previous prime is 22220011100081. The next prime is 22220011100107. The reversal of 22220011100101 is 10100111002222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22153071957025 + 66939143076 = 4706705^2 + 258726^2 .
It is a cyclic number.
It is not a de Polignac number, because 22220011100101 - 219 = 22220010575813 is a prime.
It is a super-2 number, since 2×222200111001012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22220011100107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11110005550050 + 11110005550051.
It is an arithmetic number, because the mean of its divisors is an integer number (11110005550051).
Almost surely, 222220011100101 is an apocalyptic number.
It is an amenable number.
22220011100101 is a deficient number, since it is larger than the sum of its proper divisors (1).
22220011100101 is an equidigital number, since it uses as much as digits as its factorization.
22220011100101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 22220011100101 its reverse (10100111002222), we get a palindrome (32320122102323).
The spelling of 22220011100101 in words is "twenty-two trillion, two hundred twenty billion, eleven million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •