Base | Representation |
---|---|
bin | 1010000110101100010111… |
… | …01110110010011001000101 |
3 | 2220200020020122111112011212 |
4 | 11003112023232302121011 |
5 | 10403023442242322021 |
6 | 115131453522141205 |
7 | 4452233343455246 |
oct | 503261356623105 |
9 | 86606218445155 |
10 | 22220210120261 |
11 | 70975a137354a |
12 | 25aa5134b1805 |
13 | c52483c306ca |
14 | 56b66cd6cccd |
15 | 287eea70b85b |
hex | 14358bbb2645 |
22220210120261 has 2 divisors, whose sum is σ = 22220210120262. Its totient is φ = 22220210120260.
The previous prime is 22220210120257. The next prime is 22220210120263. The reversal of 22220210120261 is 16202101202222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17575538597761 + 4644671522500 = 4192319^2 + 2155150^2 .
It is a cyclic number.
It is not a de Polignac number, because 22220210120261 - 22 = 22220210120257 is a prime.
Together with 22220210120263, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22220210120263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11110105060130 + 11110105060131.
It is an arithmetic number, because the mean of its divisors is an integer number (11110105060131).
Almost surely, 222220210120261 is an apocalyptic number.
It is an amenable number.
22220210120261 is a deficient number, since it is larger than the sum of its proper divisors (1).
22220210120261 is an equidigital number, since it uses as much as digits as its factorization.
22220210120261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 22220210120261 its reverse (16202101202222), we get a palindrome (38422311322483).
The spelling of 22220210120261 in words is "twenty-two trillion, two hundred twenty billion, two hundred ten million, one hundred twenty thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •