Base | Representation |
---|---|
bin | 1010000110101100000000… |
… | …11001111010101110110101 |
3 | 2220200012202101221111102012 |
4 | 11003112000121322232311 |
5 | 10403023100121200041 |
6 | 115131423013254005 |
7 | 4452225545354342 |
oct | 503260031725665 |
9 | 86605671844365 |
10 | 22220020100021 |
11 | 7097504087527 |
12 | 25aa47b934305 |
13 | c5245375b9b3 |
14 | 56b651a277c9 |
15 | 287ed8bc43eb |
hex | 14358067abb5 |
22220020100021 has 2 divisors, whose sum is σ = 22220020100022. Its totient is φ = 22220020100020.
The previous prime is 22220020099993. The next prime is 22220020100039. The reversal of 22220020100021 is 12000102002222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13124578401796 + 9095441698225 = 3622786^2 + 3015865^2 .
It is a cyclic number.
It is not a de Polignac number, because 22220020100021 - 230 = 22218946358197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22220020099969 and 22220020100005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22220020100041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11110010050010 + 11110010050011.
It is an arithmetic number, because the mean of its divisors is an integer number (11110010050011).
Almost surely, 222220020100021 is an apocalyptic number.
It is an amenable number.
22220020100021 is a deficient number, since it is larger than the sum of its proper divisors (1).
22220020100021 is an equidigital number, since it uses as much as digits as its factorization.
22220020100021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 22220020100021 its reverse (12000102002222), we get a palindrome (34220122102243).
The spelling of 22220020100021 in words is "twenty-two trillion, two hundred twenty billion, twenty million, one hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •