Base | Representation |
---|---|
bin | 1100110100010011110… |
… | …0011010100100111001 |
3 | 210001101010012000222201 |
4 | 3031010330122210321 |
5 | 12101432201122111 |
6 | 245054122350201 |
7 | 21623522201263 |
oct | 3150474324471 |
9 | 701333160881 |
10 | 220200020281 |
11 | 8542819743a |
12 | 3681465b361 |
13 | 179c328a3b7 |
14 | a92cb92b33 |
15 | 5adba506c1 |
hex | 3344f1a939 |
220200020281 has 2 divisors, whose sum is σ = 220200020282. Its totient is φ = 220200020280.
The previous prime is 220200020237. The next prime is 220200020303. The reversal of 220200020281 is 182020002022.
220200020281 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 145420195600 + 74779824681 = 381340^2 + 273459^2 .
It is a cyclic number.
It is not a de Polignac number, because 220200020281 - 213 = 220200012089 is a prime.
It is a super-2 number, since 2×2202000202812 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (220200020581) 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 as a sum of consecutive naturals, namely, 110100010140 + 110100010141.
It is an arithmetic number, because the mean of its divisors is an integer number (110100010141).
Almost surely, 2220200020281 is an apocalyptic number.
It is an amenable number.
220200020281 is a deficient number, since it is larger than the sum of its proper divisors (1).
220200020281 is an equidigital number, since it uses as much as digits as its factorization.
220200020281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 19.
The spelling of 220200020281 in words is "two hundred twenty billion, two hundred million, twenty thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.076 sec. • engine limits •