Base | Representation |
---|---|
bin | 1010000110101110001111… |
… | …11110111111011101100101 |
3 | 2220200022212002122120221111 |
4 | 11003113013332333131211 |
5 | 10403033030034013221 |
6 | 115132142112545021 |
7 | 4452300400014505 |
oct | 503270776773545 |
9 | 86608762576844 |
10 | 22221221001061 |
11 | 7097a6aa49225 |
12 | 25aa755b52171 |
13 | c525b54aa324 |
14 | 56b72730da05 |
15 | 28805933bbe1 |
hex | 1435c7fbf765 |
22221221001061 has 2 divisors, whose sum is σ = 22221221001062. Its totient is φ = 22221221001060.
The previous prime is 22221221000873. The next prime is 22221221001097. The reversal of 22221221001061 is 16010012212222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20291916669025 + 1929304332036 = 4504655^2 + 1388994^2 .
It is a cyclic number.
It is not a de Polignac number, because 22221221001061 - 225 = 22221187446629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22221221007061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11110610500530 + 11110610500531.
It is an arithmetic number, because the mean of its divisors is an integer number (11110610500531).
Almost surely, 222221221001061 is an apocalyptic number.
It is an amenable number.
22221221001061 is a deficient number, since it is larger than the sum of its proper divisors (1).
22221221001061 is an equidigital number, since it uses as much as digits as its factorization.
22221221001061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 22221221001061 its reverse (16010012212222), we get a palindrome (38231233213283).
The spelling of 22221221001061 in words is "twenty-two trillion, two hundred twenty-one billion, two hundred twenty-one million, one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •