Base | Representation |
---|---|
bin | 1000010001110001… |
… | …0011100011001101 |
3 | 12201212002221021202 |
4 | 2010130103203031 |
5 | 14022313400441 |
6 | 1004253235245 |
7 | 106030536623 |
oct | 20434234315 |
9 | 5655087252 |
10 | 2222012621 |
11 | a402a4a74 |
12 | 520192b25 |
13 | 29546ab8a |
14 | 17116b513 |
15 | d011919b |
hex | 847138cd |
2222012621 has 2 divisors, whose sum is σ = 2222012622. Its totient is φ = 2222012620.
The previous prime is 2222012609. The next prime is 2222012623. The reversal of 2222012621 is 1262102222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1362643396 + 859369225 = 36914^2 + 29315^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2222012621 is a prime.
Together with 2222012623, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 2222012593 and 2222012602.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2222012623) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1111006310 + 1111006311.
It is an arithmetic number, because the mean of its divisors is an integer number (1111006311).
Almost surely, 22222012621 is an apocalyptic number.
It is an amenable number.
2222012621 is a deficient number, since it is larger than the sum of its proper divisors (1).
2222012621 is an equidigital number, since it uses as much as digits as its factorization.
2222012621 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 384, while the sum is 20.
The square root of 2222012621 is about 47138.2288699947. The cubic root of 2222012621 is about 1304.9148510475.
Adding to 2222012621 its reverse (1262102222), we get a palindrome (3484114843).
The spelling of 2222012621 in words is "two billion, two hundred twenty-two million, twelve thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •